piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Dr. Boris Klemz

    Boris Klemz

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    97074 Würzburg
    Deutschland
    Building: M4
    Room: 0.006

    Teaching

    • WS 21/22: Lecture  Computational geometry
    • SS 21: Lecture  Exact algorithms
    • WS 20/21: Lecture  Advanced algorithms
    • WS 20/21: Seminar  Graph visualization
    • SS 20: Seminar  Seminar on algorithms
    • SS 20: Exercises  Computer graphics
    • WS 19/20: Lecture  Logic and discrete mathematics
    • SS 19: Lecture  Computational geometry
    • SS 19: Exercises  Computational geometry
    • SS 19: Lecture  Preparatory course on mathematics
    • WS 18/19: Lecture  Logic and discrete mathematics
    • SS 18: Lecture  Logic and discrete mathematics
    • SS 18: Exercises  Computer graphics
    • WS 17/18: Lecture  Graph visualization
    • WS 17/18: Exercises  Graph visualization
    • SS 17: Seminar  Seminar on algorithms
    • SS 17: Exercises  Computational geometry
    • WS 16/17: Exercises  Advanced algorithms I
    • SS 16: Exercises  Computer graphics
    • WS 15/16: Exercises  Advanced algorithms I

    Publications

    • 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), to appear.
            [ arXiv ]
       
    • 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 ]
       
    • 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