Author of the publication

On Strict (Outer-)Confluent Graphs.

, , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 147-161. Springer, (2019)

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

Extending simple drawings with one edge is hard., , , , , and . CoRR, (2019)Barking dogs: A Fréchet distance variant for detour detection., , , and . CoRR, (2024)Extending Partial 1-Planar Drawings., , , , and . ICALP, volume 168 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Crossing-Optimal Extension of Simple Drawings., , , , and . CoRR, (2020)Minimizing crossings in constrained two-sided circular graph layouts., and . J. Comput. Geom., 10 (2): 45-69 (2019)On Strict (Outer-)Confluent Graphs., , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 147-161. Springer, (2019)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)Efficient segment folding is hard., , , , , and . Comput. Geom., (2022)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)On Fully Diverse Sets of Geometric Objects and Graphs., and . WG, volume 13453 of Lecture Notes in Computer Science, page 328-341. Springer, (2022)