Dr. Boris Klemz

[ Aktuelle Lehre ] [ Ausgewählte Projekte ] [ Publikationen ] [ Lehrtätigkeiten ]

• WS 22/23: Vorlesung  Algorithmische Geometrie
• WS 22/23: Seminar  Visualisierung von Graphen
• SS 22: Vorlesung  Exakte Algorithmen
• SS 22: Seminar  Algorithmische Geometrie

Eine vollständige Liste der Lehrtätigkeiten ist weiter unten zu finden.

• Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing
  Boris Klemz
  • ESA'21 (29th Annual European Symposium on Algorithms)    [ 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), 2019    [ doi ]
  • GD'17 (25th International Symposium on Graph Drawing & Network Visualization)    [ doi ]
    *** Best Paper Award ***
  • EuroCG'17 (33th European Workshop on Computational Geometry)
• Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
  Michael Hoffmann, Boris Klemz
  • ESA'19 (27th Annual European Symposium on Algorithms)    [ doi ]
• 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)    [ doi ]
  • EuroCG'20 (36th European Workshop on Computational Geometry)
• 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)    [ doi ]
  • EuroCG'16 (32nd European Workshop on Computational Geometry)

• Recognizing weighted and seeded disk graphs
  Boris Klemz, Martin Nöllenburg, Roman Prutkin
  JoCG (Journal of Computational Geometry), 13(1), 2022.
        [ arXiv ]      [ doi ] 
   
• Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
  Boris Klemz, Günter Rote
  ALGO (Algorithmica), 84(4):1064-1080, 2022.
        [ arXiv ]      [ doi ] 
   
• Simplifying Non-Simple Fan-Planar Drawings
  Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder
  JGAA (Journal of Graph Algorithms and Applications), 27(2):147-172, 2023.
  Special issue on GD 2021.
        [ arXiv ]      [ doi ] 
   
• The Complexity of Finding Tangles
  Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
  SOFSEM'23 (48th International Conference on Current Trends in Theory and Practice of Computer Science), LIPIcs vl. 13878.
        [ arXiv ]      [ doi ] 
   
• Outside-Obstacle Representations with All Vertices on the Outer Face
  Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
  GD'22 (30th International Symposium on Graph Drawing & Network Visualization), LNCS vol. 13764.
        [ arXiv ]      [ doi ] 
   
• The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
  Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
  WG'22 (48th Workshop on Graph-Theoretic Conceps in Computer Science), LNCS vol. 13453.
        [ arXiv ]      [ doi ] 
   
• Outside-Obstacle Representations with All Vertices on the Outer Face
  Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
  EuroCG'22 (38th European Workshop on Computational Geometry).
        [ arXiv ]
   
• Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs
  Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink
  EuroCG'22 (38th European Workshop on Computational Geometry).
        [ arXiv ]
   
• Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing
  Boris Klemz
  ESA'21 (29th Annual European Symposium on Algorithms), LIPIcs vol. 204.
        [ doi ] 
   
• Simplifying Non-Simple Fan-Planar Drawings
  Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder
  GD'21 (29th International Symposium on Graph Drawing & Network Visualization).
        [ arXiv ]      [ doi ] 
   
• 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), LIPIcs vol. 189.
        [ arXiv ]      [ doi ] 
   
• 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 ]
   
• 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 ] 

• WS 22/23: Vorlesung  Algorithmische Geometrie
• WS 22/23: Seminar  Visualisierung von Graphen
• SS 22: Vorlesung  Exakte Algorithmen
• SS 22: Seminar  Algorithmische Geometrie
• WS 21/22: Vorlesung  Algorithmische Geometrie
• 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