( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Adjacency Graphs of Polyhedral Surfaces

, , , , , , и . Discrete & Computational Geometry, (): (2024)
DOI: 10.1007/s00454-023-00537-6

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.

Norbert Klemz

Wolfgang Klemz

Roman Klemz

Guido Klemz

Sabrina Klemz

 

Другие публикации лиц с тем же именем

The Density Formula: One Lemma to Bound Them All., , , , , и . 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., и . ICALP, том 297 из LIPIcs, стр. 99:1-99:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian., и . ESA, том 144 из LIPIcs, стр. 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., , , , , , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 271-286. Springer, (2022)Simplifying Non-Simple Fan-Planar Drawings., , , и . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing.. ESA, том 204 из LIPIcs, стр. 57:1-57:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Constrained and Ordered Level Planarity Parameterized by the Number of Levels., , , , , и . SoCG, том 293 из LIPIcs, стр. 20:1-20:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity., и . GD, том 10692 из Lecture Notes in Computer Science, стр. 440-453. Springer, (2017)Simplifying Non-simple Fan-Planar Drawings., , , и . GD, том 12868 из Lecture Notes in Computer Science, стр. 57-71. Springer, (2021)