Boris Klemz

Orcid: 0000-0002-4532-3765

Affiliations:
  • University of Würzburg, Germany


According to our database1, Boris Klemz authored at least 22 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Morphing Graph Drawings in the Presence of Point Obstacles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Simplifying Non-Simple Fan-Planar Drawings.
J. Graph Algorithms Appl., 2023

Deciding the Feasibility and Minimizing the Height of Tangles.
CoRR, 2023

The Density Formula: One Lemma to Bound Them All.
CoRR, 2023

The Complexity of Finding Tangles.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022
Recognizing weighted and seeded disk graphs.
J. Comput. Geom., 2022

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs.
Algorithmica, 2022

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Outside-Obstacle Representations with All Vertices on the Outer Face.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Adjacency Graphs of Polyhedral Surfaces.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Facets of Planar Graph Drawing
PhD thesis, 2020

2019
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity.
ACM Trans. Algorithms, 2019

Convexity-increasing morphs of planar graphs.
Comput. Geom., 2019

On the Edge-Vertex Ratio of Maximal Thrackles.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
The Partition Spanning Forest Problem.
CoRR, 2018

2017
Obedient Plane Drawings for Disk Intersection Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Strongly Monotone Drawings of Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Recognizing Weighted Disk Contact Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.
Proceedings of the Algorithm Theory - SWAT 2014, 2014


  Loading...