English Intern
Lehrstuhl für Informatik I - Algorithmen und Komplexität

Dr. Boris Klemz

Boris Klemz

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
97074 Würzburg
Deutschland
Gebäude: M4
Raum: 1.003

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

Aktuelle Lehrveranstaltungen

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

Ausgewählte Forschungsprojekte

  • 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 ]
  • Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
    Boris Klemz, Marie Diana Sieper
    • ICALP'24 (51st EATCS International Colloquium on Automata, Languages and Programming)    [ doi ]
  • Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian
    Michael Hoffmann, Boris Klemz
    • ESA'19 (27th Annual European Symposium on Algorithms)    [ doi ]
  • The Density Formula: One Lemma to Bound Them All
    Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
    • GD'24 (32nd International Symposium on Graph Drawing & Network Visualization)    [ doi ]
      *** Best Paper Award ***
  • Constrained and Ordered Level Planarity Parameterized by the Number of Levels
    Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
    • JoCG (Journal of Computational Geometry), 2025
      * Special issue on SoCG'24 *
    • SoCG'24 (40th International Symposium on Computational Geometry)    [ 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)
  • Adjacency Graphs of Polyhedral Surfaces
    Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
    • DCG (Discrete & Computational Geometry), 2024    [ doi ]
    • 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)

Eine vollständige Publikationsliste ist weiter unten zu finden.

Arbeit in Ausschüssen

  • Programmausschuss WG 2025 (51st International Workshop on Graph-Theoretic Concepts in Computer Science)
  • Programmausschuss GD 2024 (32nd International Symposium on Graph Drawing and Network Visualization)
  • Programmausschuss EuroCG 2023 (39th European Workshop on Computational Geometry)
  • Organisationsausschuss EuroCG 2018 (34th European Workshop on Computational Geometry)

Vollständige Publikationsliste

  • Constrained and Ordered Level Planarity Parameterized by the Number of Levels
    Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
    JoCG (Journal of Computational Geometry), 2025, to appear.
    * Special issue on SoCG 2024 *
          [ arXiv ] 
     
  • Deciding the Feasibility and Minimizing the Height of Tangles
    Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
    JGAA (Journal of Graph Algorithms and Applications), 29(1):135-158, 2025.
          [ arXiv ]      [ doi ] 
     
  • Partial Level Planarity Parameterized by the Size of the Missing Graph
    Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper
    EuroCG'25 (41st European Workshop on Computational Geometry).
     
  • Outside-Obstacle Representations with All Vertices on the Outer Face
    Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
    CGT (Computing in Geometry and Topology), 4(1), 2:1–2:21, 2025.
          [ arXiv ]      [ doi ] 
     
  • Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
    Boris Klemz, Marie Diana Sieper
    ICALP'24 (51st EATCS International Colloquium on Automata, Languages and Programming), LIPIcs vol. 297.
          [ arXiv ]      [ doi ] 
     
  • Constrained and Ordered Level Planarity Parameterized by the Number of Levels
    Václav Blažej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
    SoCG'24 (40th International Symposium on Computational Geometry), LIPIcs vol. 293.
          [ arXiv ]      [ doi ] 
     
  • The Density Formula: One Lemma to Bound Them All
    Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt
    GD'24 (32nd International Symposium on Graph Drawing & Network Visualization), LIPIcs vol. 320.
    *** Best Paper Award ***
          [ arXiv ]      [ doi ] 
     
  • Morphing Graph Drawings in the Presence of Point Obstacles
    Oksana Firman, Tim Hegemann, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink
    SOFSEM'24 (49th International Conference on Current Trends in Theory and Practice of Computer Science), LNCS vol. 14519.
          [ arXiv ]      [ doi ] 
     
  • Adjacency Graphs of Polyhedral Surfaces
    Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff
    DCG (Discrete & Computational Geometry), 71(4): 1429-1455, 2024.
          [ 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), LNCS vol. 13878.
          [ arXiv ]      [ doi ] 
     
  • Recognizing weighted and seeded disk graphs
    Boris Klemz, Martin Nöllenburg, Roman Prutkin
    JoCG (Journal of Computational Geometry), 13(1), 2022.
          [ doi ] 
     
  • Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
    Boris Klemz, Günter Rote
    Algorithmica, 84(4):1064-1080, 2022.
          [ 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.
          [ 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).
     
  • Recognizing Weighted Disk Contact Graphs
    Boris Klemz, Martin Nöllenburg, Roman Prutkin
    EuroCG'15 (31st European Workshop on Computational Geometry).
     
  • 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 ] 

Vollständige Liste der Lehrtätigkeiten