Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Boris Klemz
Observed name:
Klemz, Boris
Institution:
University of Würzburg
Observed institutions:
Karlsruhe Institute of Technology,
University of Würzburg,
Freie Universität Berlin,
Technische Universität Braunschweig
ORCID:
0000-0002-4532-3765
Observed ORCID:
0000-0002-4532-3765
OpenAlex ID:
A5079179062
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity
2019
·
Boris Klemz
, Günter Rote
·
ACM Transactions on Algorithms
·
20
PDF
Strongly Monotone Drawings of Planar Graphs
2016
·
Felsner, Stefan
, Igamberdiev, Alexander
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
20
PDF
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
2014
·
Boris Klemz
, Tamara Mchedlidze
, et al.
·
Lecture notes in computer science
·
19
Convexity-Increasing Morphs of Planar Graphs
2018
·
Linda Kleist
, Boris Klemz
, et al.
·
Computational Geometry
·
17
PDF
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
2022
·
Boris Klemz
, Günter Rote
·
Algorithmica
·
15
PDF
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
2019
·
Hoffmann, Michael
, Klemz, Boris
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
14
PDF
Simplifying Non-simple Fan-Planar Drawings
2021
·
Boris Klemz
, Kristin Knorr
, et al.
·
Lecture notes in computer science
·
12
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing
2021
·
Klemz, Boris
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
11
PDF
The Partition Spanning Forest Problem
2018
·
Kindermann, Philipp
, Klemz, Boris
, et al.
·
arXiv (Cornell University)
·
11
PDF
Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
2018
·
Boris Klemz
, Günter Rote
·
Lecture notes in computer science
·
11
Recognizing Weighted Disk Contact Graphs
2015
·
Boris Klemz
, Martin Nöllenburg
, et al.
·
Lecture notes in computer science
·
11
Simplifying Non-Simple Fan-Planar Drawings
2023
·
Boris Klemz
, Kristin Knorr
, et al.
·
Journal of Graph Algorithms and Applications
·
8
PDF
Outside-Obstacle Representations with All Vertices on the Outer Face
2022
·
Firman, Oksana
, Kindermann, Philipp
, et al.
·
arXiv (Cornell University)
·
5
PDF
Adjacency Graphs of Polyhedral Surfaces
2023
·
Elena Arseneva
, Linda Kleist
, et al.
·
Discrete & Computational Geometry
·
4
PDF
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
2024
·
Blažej, Václav
, Klemz, Boris
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number
2024
·
Klemz, Boris
, Sieper, Marie Diana
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
Outside-Obstacle Representations with All Vertices on the Outer Face
2023
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Lecture notes in computer science
·
3
The Complexity of Finding Tangles
2022
·
Oksana Firman
, Philipp Kindermann
, et al.
·
Lecture notes in computer science
·
3
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
2022
·
Ina Goeßmann
, Jonathan Klawitter
, et al.
·
Lecture notes in computer science
·
3
PDF
Morphing Graph Drawings in the Presence of Point Obstacles
2024
·
Oksana Firman
, Tim Hegemann
, et al.
·
Lecture notes in computer science
·
2
On the Edge-Vertex Ratio of Maximal Thrackles
2019
·
Oswin Aichholzer
, Linda Kleist
, et al.
·
Lecture notes in computer science
·
2
PDF
Obedient Plane Drawings for Disk Intersection Graphs
2017
·
Bahareh Banyassady
, Michael Hoffmann
, et al.
·
Lecture notes in computer science
·
2
Recognizing Weighted Disk Contact Graphs
2015
·
Klemz, Boris
, Nöllenburg, Martin
, et al.
·
arXiv (Cornell University)
·
2
PDF
Morphing graph drawings in the presence of point obstacles
2026
·
Oksana Firman
, Tim Hegemann
, et al.
·
Journal of Computer and System Sciences
·
1
Point Set Embeddability with List Constraints
2026
·
Depian, Thomas
, Dorfer, Joseph
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
1
PDF
Show more works
View as search
Works count:
34
Citation count:
235
H-index:
11
I10-index:
12
Year
Topic
Type