Author of the publication

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs.

, , and . Comput. Geom. Topol., 3 (2): 5:1-5:30 (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

Routing in polygonal domains., , , , , , , , , and . Comput. Geom., (2020)Crossing-Optimal Extension of Simple Drawings., , , , and . CoRR, (2020)On Weighted Sums of Numbers of Convex Polygons in Point Sets., , , , and . Discret. Comput. Geom., 68 (2): 448-476 (2022)Flip Distances Between Graph Orientations., , , , , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 120-134. Springer, (2019)Blocking delaunay triangulations., , , , , , and . CCCG, page 21-24. (2010)Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs., , and . GD (2), volume 14466 of Lecture Notes in Computer Science, page 34-50. Springer, (2023)Embedding Four-directional Paths on Convex Point Sets., , , , and . J. Graph Algorithms Appl., 19 (2): 743-759 (2015)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)Drawing Graphs as Spanners., , , , , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 310-324. Springer, (2020)On the number of plane graphs., , , , , and . SODA, page 504-513. ACM Press, (2006)