( en | de | ru )

 

Disambiguation of "Klemz, Boris"

Author of the publication

copydeleteadd this publication to your clipboard
Morphing Graph Drawings in the Presence of Point Obstacles

, , , , , , and . Proc. 50th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'24), volume 14519 of Lecture Notes in Computer Science, page . Springer-Verlag, (2024)
DOI: 10.1007/978-3-031-52113-3_17

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.

Norbert Klemz

Wolfgang Klemz

Roman Klemz

Guido Klemz

Sabrina Klemz

 

Other publications of authors with the same name

The Density Formula: One Lemma to Bound Them All., , , , , and . CoRR, (2023)Facets of Planar Graph Drawing. FU Berlin, Germany, (2020)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/28715).Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number., and . ICALP, volume 297 of LIPIcs, page 99:1-99:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian., and . ESA, volume 144 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs., , , , , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 271-286. Springer, (2022)Simplifying Non-Simple Fan-Planar Drawings., , , and . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing.. ESA, volume 204 of LIPIcs, page 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Constrained and Ordered Level Planarity Parameterized by the Number of Levels., , , , , and . SoCG, volume 293 of LIPIcs, page 20:1-20:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Morphing Graph Drawings in the Presence of Point Obstacles., , , , , , and . CoRR, (2023)Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs, , , , , , and . Proc. 38th Europ. Workshop Comput. Geom. (EuroCG'22), page 53:1--6. (2022)