Dr. Boris Klemz
Boris Klemz
Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
Universität Würzburg
Am Hubland
97074
Würzburg
Deutschland
Gebäude:
M4
Raum:
0.006
E-Mail:
boris.klemz@uni-wuerzburg.de

Lehrveranstaltungen
- SS 21: Vorlesung Exakte Algorithmen
- WS 20/21: Vorlesung Advanced Algorithms
- WS 20/21: Seminar Visualisierung von Graphen
- SS 20: Seminar Seminar über Algorithmen
- SS 20: Übungen Computergrafik
- WS 19/20: Vorlesung Logik und diskrete Mathematik
- SS 19: Vorlesung Algorithmische Geometrie
- SS 19: Übungen Algorithmische Geometrie
- SS 19: Vorlesung Brückenkurs Mathematik für Informatiker und Mathematiker
- WS 18/19: Vorlesung Logik und diskrete Mathematik
- SS 18: Vorlesung Logik und diskrete Mathematik
- SS 18: Übungen Computergrafik
- WS 17/18: Vorlesung Algorithmen zur Visualisierung von Graphen
- WS 17/18: Übungen Algorithmen zur Visualisierung von Graphen
- SS 17: Seminar Seminar über Algorithmen
- SS 17: Übungen Algorithmische Geometrie
- WS 16/17: Übungen Höhere Algorithmik I
- SS 16: Übungen Computergrafik
- WS 15/16: Übungen Höhere Algorithmik I
Veröffentlichungen
- Adjacency Graphs of Polyhedral Surfaces
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
SoCG'21 (37th International Symposium on Computational Geometry), accepted for publication.
[ arXiv ]
- Representing Graphs by Polygons with Edge Contacts in 3D
Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
EuroCG'20 (36th European Workshop on Computational Geometry).
[ arXiv ]
- Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
Michael Hoffmann, Boris Klemz
ESA'19 (27th Annual European Symposium on Algorithms), LIPICS vol. 144.
[ doi ]
- On the Edge-Vertex Ratio of Maximal Thrackles
Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber
GD'19 (27th International Symposium on Graph Drawing & Network Visualization), LNCS vol. 11904.
[ arXiv ] [ doi ]
- Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity
Boris Klemz, Günter Rote
ACM TALG (Transactions on Algorithms), 15(4):53:1-53:25, 2019.
[ arXiv ] [ doi ]
- Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
CGTA (Computational Geometry: Theory and Applications), 84:69-88, 2019.
Special issue on EuroCG 2018.
[ arXiv ] [ doi ]
- Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
Boris Klemz, Günter Rote
Preprint. Submitted for publication.
[ arXiv ]
- Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
WG'18 (44th Workshop on Graph-Theoretic Conceps in Computer Science), LNCS vol. 11159.
[ arXiv ] [ doi ]
- The Partition Spanning Forest Problem
Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider and André Schulz
EuroCG'18 (34th European Workshop on Computational Geometry).
[ arXiv ]
- Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
EuroCG'18 (34th European Workshop on Computational Geometry).
[ arXiv ]
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
Boris Klemz, Günter Rote
GD'17 (25th International Symposium on Graph Drawing & Network Visualization), LNCS vol. 10692.
*** Best Paper Award ***
[ arXiv ] [ doi ]
- Obedient Plane Drawings for Disk Intersection Graphs
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
WADS'17 (15th International Symposium on Algorithms and Data Structures), LNCS vol. 10389.
[ doi ]
- Ordered Level Planarity and Geodesic Planarity
Boris Klemz, Günter Rote
EuroCG'17 (33th European Workshop on Computational Geometry).
[ arXiv ]
- Strongly Monotone Drawings of Planar Graphs
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher
SoCG'16 (32nd International Symposium on Computational Geometry), LIPICS vol. 51.
[ arXiv ] [ doi ]
- Strongly Monotone Drawings of Planar Graphs
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher
EuroCG'16 (32nd European Workshop on Computational Geometry).
[ arXiv ]
- Recognizing Weighted Disk Contact Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
GD'15 (23rd International Symposium on Graph Drawing & Network Visualization), LNCS vol. 9411.
[ arXiv ] [ doi ]
- Recognizing Weighted and Seeded Disk Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
CG:YRF'15 (4th Young Researchers Forum of the Computational Geometry Week).
[ arXiv ]
- Recognizing Weighted Disk Contact Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
EuroCG'15 (31st European Workshop on Computational Geometry).
[ arXiv ]
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg
SWAT'14 (14th Scandinavian Symposium and Workshops on Algorithm Theory), LNCS vol. 8503.
[ doi ]