( en | de | ru )

 

Disambiguation of "Klemz, Boris"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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)Convexity-increasing morphs of planar graphs., , , , , and . Comput. Geom., (2019)The Density Formula: One Lemma to Bound Them All., , , , , and . CoRR, (2023)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., and . Algorithmica, 84 (4): 1064-1080 (2022)Deciding the Feasibility and Minimizing the Height of Tangles., , , , , and . CoRR, (2023)Facets of Planar Graph Drawing. FU Berlin, Germany, (2020)base-search.net (ftfuberlin:oai:refubium.fu-berlin.de:fub188/28715).Constrained and Ordered Level Planarity Parameterized by the Number of Levels, , , , , and . Proc. 40th Annu. Sympos. Comput. Geom. (SoCG'24), volume 293 of LIPIcs, page . Schloss Dagstuhl – Leibniz-Zentrum für Informatik, (2024)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., and . CoRR, (2017)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)Morphing Graph Drawings in the Presence of Point Obstacles., , , , , , and . CoRR, (2023)