Research Interests
My biggest interest lies in discrete geometry and graph drawing. Currently, most of my research falls under geometric graph theory, although I occasionally also work on extremal problems in discrete geometry. Sometimes, these two topics intersect and then I'm the happiest.
My favorite topics as of recently are proximity structures on point sets (in particular Euclidean MSTs) and problems involving intersection representations of graphs.
More broadly, I enjoy all areas of combinatorics, and especially I like seeing the interplay between combinatorics and different areas of mathematics, such as algebra, probability, geometry or topology.
Papers
Two Results on Outer-String Graphs (with Vít Jelínek, Jan Kratochvíl and Peter Stumpf) - accepted to GD 2026, arXiv
How Close is a Tree to a Euclidean Minimum Spanning Tree? (total of 11 coauthors) - accepted to GD 2026
How many times can two minimum spanning trees cross? (with Morteza Saghafian, Maria Saumell, Felix Schröder, Josef Tkadlec and Pavel Valtr) - accapted to LATIN 2026, arXiv, slides
Edge-Constrained Hamiltonian Paths in a Point Set (with Aleksa Džuklevski, Jiri Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell and Johannes Zink) - SOFSEM 2026, arXiv, slides (by Johannes)
Crossing and Non-Crossing Families (with Martin Balko and Birgit Vogtenhuber) - GD 2025, arXiv, slides
Bend number of cocomparability graphs (with Vít Jelínek, Maritn Pergel, Felix Schröder, Peter Stumpf and Pavel Valtr) - GD 2025, slides
Unbent Collections of Orthogonal Drawings (with Giuseppe Liotta, Tomáš Masařík, Giacomo Ortali, Matthias Pfretzschne, Peter Stumpf, Alexander Wolff, and Johannes Zink) - WG 2025, arXiv - slides
Star-Forest Decompositions of Complete graphs (with Jelena Glišić and Milan Milivojčević) - IWOCA 2024, arXiv, EuroCG 2024 - slides
Convex-Geometric k-planar Graphs are Convex-Geometric (k+1)-quasiplanar - IWOCA 2024, GD2023 (poster abstract) - slides
Other
The Erdos–Szekeres Theorem for Not-Too-Restricted Point Sets (with Martin Balko, Koki Furukawa, Jelena Glišić and Pavel Valtr) - abstract accepted for presentation at JCDCG^3 2026
QEDBENCH: Quantifying the Alignment Gap in Automated Evaluation of University-Level Mathematical Proofs - larger project coordinated by people conducting research in LLMs, I just graded some AI generated solutions - accepted to ICML 2026, arXiv
Relationships between k-planar and h-quasiplanar graphs - Master thesis supervised by Professor Pavel Valtr - it won an award
Cross-polytopal Alexander duality - Bachelor reasearch project supervised by Professor Russ Woodroofe - Paper