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

Triangulations with Circular Arcs., , , , , and . J. Graph Algorithms Appl., 19 (1): 43-65 (2015)On pseudo-convex decompositions, partitions, and coverings., , , , and . EuroCG, page 89-92. Technische Universiteit Eindhoven, (2005)Graph Drawings with Relative Edge Length Specifications., , , and . CCCG, Carleton University, Ottawa, Canada, (2014)An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings., , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 505-516. Springer, (2015)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)Flip Distances Between Graph Orientations., , , , , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 120-134. Springer, (2019)Reconstructing Point Set Order Types from Radial Orderings., , , , and . Int. J. Comput. Geom. Appl., 26 (3-4): 167-184 (2016)Embedding Four-directional Paths on Convex Point Sets., , , , and . J. Graph Algorithms Appl., 19 (2): 743-759 (2015)On (Pointed) Minimum Weight Pseudo-Triangulations., , , and . CCCG, page 209-212. Carleton University, Ottawa, Canada, (2007)Blocking delaunay triangulations., , , , , , and . CCCG, page 21-24. (2010)