Author of the publication

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

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , and . CoRR, (2020)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)Simultaneous Orthogonal Planarity, , , , , , , , , and . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, volume 9801 of Lecture Notes in Computer Science, page 532--545. Springer, (September 2016)On the Complexity of Some Problems Related to SEFE., , and . CoRR, (2013)On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , and . CoRR, (2014)Algorithms and Bounds for L-Drawings of Directed Graphs., , , , , , and . Int. J. Found. Comput. Sci., 29 (4): 461-480 (2018)C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width., , , and . Algorithmica, 83 (8): 2471-2502 (2021)2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , and . SODA, page 2779-2798. SIAM, (2021)Upward Book Embeddings of st-Graphs., , , , , and . SoCG, volume 129 of LIPIcs, page 13:1-13:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On Planar Greedy Drawings of 3-Connected Planar Graphs., , and . SoCG, volume 77 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)