Author of the publication

Crossing-Optimal Extension of Simple Drawings.

, , , , and . ICALP, volume 198 of LIPIcs, page 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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

On Strict (Outer-)Confluent Graphs., , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 147-161. Springer, (2019)Crossing-Optimal Extension of Simple Drawings., , , , and . CoRR, (2020)On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem., , and . STACS, volume 96 of LIPIcs, page 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Extending Partial 1-Planar Drawings., , , , and . ICALP, volume 168 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Maximizing Ink in Partial Edge Drawings of k-plane Graphs., , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 323-336. Springer, (2019)Mixed Linear Layouts: Complexity, Heuristics, and Experiments., , and . GD, volume 11904 of Lecture Notes in Computer Science, page 460-467. Springer, (2019)Four Pages Are Indeed Necessary for Planar Graphs., , , , , and . CoRR, (2020)On Fully Diverse Sets of Geometric Objects and Graphs., and . WG, volume 13453 of Lecture Notes in Computer Science, page 328-341. Springer, (2022)Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3., and . WG, volume 12301 of Lecture Notes in Computer Science, page 248-260. Springer, (2020)Crossing-Optimal Extension of Simple Drawings., , , , and . ICALP, volume 198 of LIPIcs, page 72:1-72:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)