Author of the publication

Computing Optimal Tangles Faster

, , , , and . Proceedings of the 35th European Workshop on Computational Geometry (EuroCG'19), Utrecht, (2019)Abstract.

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

Visual Analytics for Sets over Time and Space (Dagstuhl Seminar 19192)., , and . Dagstuhl Reports, 9 (5): 31-57 (2019)Coloring and Recognizing Mixed Interval Graphs, , , , , and . Proc. 34th Annu. Int. Symp. Algorithms Comput. (ISAAC'23), volume 283 of LIPIcs, page 36:1--36:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2023)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)Computing Optimal Tangles Faster, , , , and . Proc. 35th Europ. Workshop Comput. Geom. (EuroCG'19), page 61:1-7. (2019)Improved Approximation Algorithms for Box Contact Representations, , , , , , , and . Algorithmica, (2016)Planar L-Drawings of Directed Graphs, , , , , , , and . CoRR, (2017)Beyond Outerplanarity, , , , and . Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD'17), Springer-Verlag, (2017)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)Approximating the Generalized Minimum Manhattan Network Problem, , , , , and . Algorithmica, (March 2017)