( en | de | ru )

 

Disambiguation of "Klemz, Boris"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding the Feasibility and Minimizing the Height of Tangles.

, , , , , and . CoRR, (2023)

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

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 Density Formula: One Lemma to Bound Them All., , , , , and . CoRR, (2023)Convexity-increasing morphs of planar graphs., , , , , and . Comput. Geom., (2019)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., and . 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., , , , , and . CoRR, (2023)Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity., and . ACM Trans. Algorithms, 15 (4): 53:1-53:25 (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)Recognizing weighted and seeded disk graphs., , and . J. Comput. Geom., (2022)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)