( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs

, , , , , , и . Proc. 38th Europ. Workshop Comput. Geom. (EuroCG'22), стр. 53:1--6. (2022)

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

 

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

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 Density Formula: One Lemma to Bound Them All., , , , , и . CoRR, (2023)Convexity-increasing morphs of planar graphs., , , , , и . Comput. Geom., (2019)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., и . Algorithmica, 84 (4): 1064-1080 (2022)Facets of Planar Graph Drawing. FU Berlin, Germany, (2020)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/28715).Deciding the Feasibility and Minimizing the Height of Tangles., , , , , и . CoRR, (2023)Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity., и . ACM Trans. Algorithms, 15 (4): 53:1-53:25 (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)Recognizing weighted and seeded disk graphs., , и . J. Comput. Geom., (2022)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)