Author of the publication

Flipping Plane Spanning Paths.

, , , , , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 49-60. Springer, (2023)

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

Nearest-Neighbor Decompositions of Drawings., , , , , and . SWAT, volume 227 of LIPIcs, page 21:1-21:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens., , , , and . J. Graph Algorithms Appl., 26 (3): 381-399 (2022)Dynamic Connectivity in Disk Graphs., , , , , , and . CoRR, (2021)On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens., , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 382-389. Springer, (2020)Simplifying Non-Simple Fan-Planar Drawings., , , and . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)Flipping Plane Spanning Paths., , , , , , , and . CoRR, (2022)Dynamic Connectivity in Disk Graphs., , , , , , and . Discret. Comput. Geom., 71 (1): 214-277 (January 2024)The Density Formula: One Lemma to Bound Them All., , , , , and . CoRR, (2023)Flipping Plane Spanning Paths., , , , , and . WALCOM, volume 13973 of Lecture Notes in Computer Science, page 49-60. Springer, (2023)Dynamic Connectivity in Disk Graphs., , , , , , and . SoCG, volume 224 of LIPIcs, page 49:1-49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)