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

Improved Approximation Algorithms for Box Contact Representations, , , , , , , and . Algorithmica, (2016)Planar L-Drawings of Directed Graphs, , , , , , , and . CoRR, (2017)Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , and . Dagstuhl Reports, 9 (5): 31-57 (2019)Computing Optimal Tangles Faster, , , , and . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), page 61:1-7. (2019)Robust gateway placement for scalable lorawan, , , , and . 2021 13th IFIP Wireless and Mobile Networking Conference (WMNC), page 71--78. IEEE, (2021)Recognizing Stick Graphs with and without Length Constraints., , , , , , and . J. Graph Algorithms Appl., 24 (4): 657-681 (2020)The Traveling Salesman Problem Under Squared Euclidean Distances, , , , and . Proc. 27th Internat. Sympos. Theoretical Aspects Comput. Sci. (STACS'10), page 239--250. Nancy, (2010)Compact Drawing of Clustered Layered Graphs, , and . Poster at 32nd Internat. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'06), (2006)A Simple Proof for the NP-Hardness of Edge Labeling. Technical report, 11/2000. #UG#, (September 2000)Computing Storyline Visualizations with Few Block Crossings, , , and . Proc. 25th Int. Sympos. Graph Drawing Network Vis. (GD'17), volume 10692 of Lecture Notes in Computer Science, page 365--378. Springer-Verlag, (2018)