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

Colored Non-crossing Euclidean Steiner Forest., , , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 429-441. Springer, (2015)Simultaneous Orthogonal Planarity., , , , , , , , , and . Graph Drawing, volume 9801 of Lecture Notes in Computer Science, page 532-545. Springer, (2016)Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles., , , and . Graph Drawing, volume 11282 of Lecture Notes in Computer Science, page 152-166. Springer, (2018)Graph Drawing Contest Report., , , and . Graph Drawing, volume 11282 of Lecture Notes in Computer Science, page 609-617. Springer, (2018)Experimental Analysis of the Accessibility of Drawings with Few Segments., , and . J. Graph Algorithms Appl., 22 (3): 501-518 (2018)On the Planar Split Thickness of Graphs., , , , , , , , , and . Algorithmica, 80 (3): 977-994 (2018)Improved Approximation Algorithms for Box Contact Representations., , , , , , , and . Algorithmica, 77 (3): 902-920 (2017)Recognizing and Drawing IC-Planar Graphs., , , , , and . Graph Drawing, volume 9411 of Lecture Notes in Computer Science, page 295-308. Springer, (2015)Minimum rectilinear polygons for given angle sequences., , , , , and . Comput. Geom., (2022)Computing Height-Optimal Tangles Faster., , , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 203-215. Springer, (2019)