Author of the publication

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)

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 . J. Graph Algorithms Appl., 25 (1): 481-512 (2021)Exploring Semi-Automatic Map Labeling., , , , and . SIGSPATIAL/GIS, page 13-22. ACM, (2019)Extending simple drawings with one edge is hard., , , , , and . CoRR, (2019)Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts., and . Symposium on Computational Geometry, volume 99 of LIPIcs, page 53:1-53:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)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 fuer Informatik, (2018)Minimizing crossings in constrained two-sided circular graph layouts., and . JoCG, 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)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)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)