Author of the publication

Plane Hamiltonian Cycles in Convex Drawings.

, , , , and . SoCG, volume 293 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs., , and . Comput. Geom. Topol., 3 (2): 5:1-5:30 (2024)On the Uncrossed Number of Graphs., , , , , and . GD, volume 320 of LIPIcs, page 18:1-18:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Graph drawing applications in combinatorial theory of maturity models., , , , , and . CoRR, (2024)Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles., , and . GD, volume 320 of LIPIcs, page 34:1-34:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Edge Partitions of Complete Geometric Graphs., , , , , , , and . SoCG, volume 224 of LIPIcs, page 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Plane Hamiltonian Cycles in Convex Drawings., , , , and . SoCG, volume 293 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Edge Partitions of Complete Geometric Graphs (Part 2)., , , , , , , and . CoRR, (2021)Holes in Convex and Simple Drawings., , , and . GD, volume 320 of LIPIcs, page 5:1-5:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)