Research Interests
I am usually interested in problems that involve combinatorial objects which also contain some geometric/topological and/or algebraic structure. Lately I have beeen working in problems in discrete geometry and graph drawing.
Papers
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 Kratochvil, 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
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 - 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