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

On the Complexity of Clustered-Level Planarity and T-Level Planarity., , , , and . CoRR, (2014)Universal Slope Sets for 1-Bend Planar Drawings., , , and . CoRR, (2017)On the Complexity of Some Problems Related to SEFE., , and . CoRR, (2013)One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons, , , , and . Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), page 70:1--70:6. Würzburg, (2020)Abstract.2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees., , , , and . CoRR, (2020)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)Simultaneous Orthogonal Planarity, , , , , , , , , and . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, page 532-545. Springer, (2016)Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity., , , and . J. Graph Algorithms Appl., 24 (4): 573-601 (2020)Monotone Drawings of Graphs with Fixed Embedding., , , , , , and . Algorithmica, 71 (2): 233-257 (2015)Universal Slope Sets for 1-Bend Planar Drawings., , , and . Algorithmica, 81 (6): 2527-2556 (2019)