Dr. Philipp Kindermann

English

Betreute Arbeiten

Bachelorarbeiten

• Implementierung eines Algorithmus für das glatt-orthogonale Zeichnen planarer Graphen, Bernhard Häussner, abgeschlossen, 2014
• Rechtecksdarstellung gewichteter außenplanarer Graphen, Lorenz Reinhart, abgeschlossen, 2014

Masterarbeiten

• Algorithmische Lösungen zur Maximierung der minimalen Kreuzungswinkel von Graphzeichnungen, Matthias Zoche, abgeschlossen, 2017
• Schieforthogonale Zeichnungen, Wadim Reimche, abgeschlossen, 2015
• Boundary Labeling for Annotations in Texts, Fabian Lipp, abgeschlossen, 2014

Artikel in Zeitschriften

• Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, in Journal of Graph Algorithms and Applications, Vol. 25, No. 1, pp. 1-28, 2021.
• Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz; Birgit Vogtenhuber: Lombardi drawings of knots and links, in Journal of Computational Geometry, Volume 10, No 1, pp 444-476, 2019
• Patrizio Angelini; Michael A. Bekos; Michael Kaufmann; Philipp Kindermann; Thomas Schneck: 1-Fan-Bundle-Planar Drawings of Graphs, in Theoretical Computer Science
• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Planar Graphs with Few Geometric Primitives, in J. Graph Algorithms Appl., Vol. 22, No. 2, 2018, pp. 357--387
• Philipp Kindermann; Wouter Meulemans; André Schulz: Experimental Analysis of the Accessibility of Drawings with Few Segments, in J. Graph Algorithms Appl., Vol. 22, No. 3, 2018, pp. 501-518
• David Eppstein; Philipp Kindermann; Stephen Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen Wismath: On the Planar Split Thickness of Graphs, in Algorithmica, Special Issue on Selected Papers from LATIN'16, Vol. 80, no. 3, 2018, pp. 977-994.
• Michael A. Bekos; Thomas C. van Dijk; Martin Fink; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff: Improved Approximation Algorithms for Box Contact Representations, in Algorithmica, Vol. 77, no. 3, 2017, pp. 902-920
• Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer; André Schulz; Alexander Wolff: Multi-Sided Boundary Labeling, in Algorithmica, Vol. 76, no. 1, 2016, pp. 225-258
• Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani: Recognizing and Drawing IC-Planar Graphs, in Theoretical Computer Science, Vol. 636, 2016, pp. 1-16
• Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends, in Journal of Graph Algorithms and Applications, Vol. 20, no. 1, 2016, pp. 133-158

Konferenzbandbeiträge

• Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, in Graph Drawing, Lecture Notes in Computer Science, Springer, Vol. 11282, 2018, pp. 152-166
• Patrizio Angelini; Michael A. Bekos; Michael Kaufmann; Philipp Kindermann; Thomas Schneck: 1-Fan-Bundle-Planar Drawings of Graphs, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 517-530
• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Trees and Triangulations with Few Geometric Primitives, in Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17), pp. 316-329
• Philipp Kindermann; Wouter Meulemans; André Schulz: Experimental analysis of the accessibility of drawings with few segments, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 52-64
• William Devanny; Philipp Kindermann; Maarten Löffler; Ignaz Rutter: Graph Drawing Contest Report, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 572-582
• Philipp Kindermann; Stephen Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz; Birgit Vogtenhuber: Lombardi Drawings of Knots and Links, in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17), pp. 113-126
• Helmut Alt; Kevin Buchin; Stephen Chaplick; Otfried Cheong; Philipp Kindermann; Christian Knauer; Fabian Stehn: Placing your Coins on a Shelf, in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC'17), pp. 4:1-4:12
• Philipp Kindermann; Maarten Löffler; Lev Nachmanson; Ignaz Rutter: Graph Drawing Contest Report, in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), pp. 589-595
• David Eppstein; Philipp Kindermann; Stephen Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen Wismath: On the Planar Split Thickness of Graphs, in Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), pp. 403-415
• Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Giuseppe Di Battista; Peter Eades; Philipp Kindermann; Jan Kratochvíl; Fabian Lipp; Ignaz Rutter: Simultaneous Orthogonal Planarity, in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), pp. 532-545
• Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher: Strongly Monotone Drawings of Planar Graphs, in Proceedings of the 32nd International Symposium on Computational Geometry (SoCG'16), pp. 37:1--37:15
• Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Valentino Di Donato; Philipp Kindermann; Günter Rote; Ignaz Rutter: Windrose Planarity: Embedding Graphs with Direction-Constrained Edges, in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'16), pp. 985-996
• Sergey Bereg; Krzysztof Fleszar; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff: Colored Non-Crossing Euclidean Steiner Forest, in Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15), pp. 429-441
• Philipp Kindermann; Maarten Löffler; Lev Nachmanson; Ignaz Rutter: Graph Drawing Contest Report, in Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD'15), pp. 531-537
• William S. Evans; Krzysztof Fleszar; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff: Minimum Rectilinear Polygons for Given Angle Sequences, in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG^2 2015), pp. 105-119
• Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani: Recognizing and Drawing IC-Planar Graphs, in Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD'15), pp. 295-308
• Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends, in Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM'15), pp. 222-233
• Michael A. Bekos; Thomas C. van Dijk; Martin Fink; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff: Improved Approximation Algorithms for Box Contact Representations, in Proceedings of the 22nd Annual European Symposium on Algorithms (ESA'14), pp. 87-99
• Philipp Kindermann; Fabian Lipp; Alexander Wolff: Luatodonotes: Boundary Labeling for Annotations in Texts, in Proceedings of the 23rd International Symposium on Graph Drawing (GD'14), pp. 76-88
• Philipp Kindermann; André Schulz; Joachim Spoerhase; Alexander Wolff: On Monotone Drawings of Trees, in Proceedings of the 23rd International Symposium on Graph Drawing (GD'14), pp. 488-500
• Muhammad Jawaherul Alam; Michael A. Bekos; Michael Kaufmann; Philipp Kindermann; Stephen G. Kobourov; Alexander Wolff: Smooth Orthogonal Drawings of Planar Graphs, in Proceedings of the 13th Latin American Symposium on Theorectical Informatics (LATIN'14), pp. 144-155
• Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer; André Schulz; Alexander Wolff: Two-Sided Boundary Labeling with Adjacent Sides, in Proceedings of the 13th International Symposium on Algorithms and Data Structures (WADS'13), pp. 463-474

Workshopbeiträge

• Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz: The Partition Spanning Forest Problem, in Proc. 34th European Workshop on Computational Geometry (EuroCG'18)
• Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz: Drawing Trees and Triangulations with Few Geometric Primitives, in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16), pp. 55-58, Abstract
• Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher: Strongly Monotone Drawings of Planar Graphs, in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG'16), pp. 59-62, Abstract
• Steven Chaplick; Fabian Lipp; Philipp Kindermann; Alexander Wolff: Solving Optimization Problems on Orthogonal Ray Graphs, in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG^2 2015)
• Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer; André Schulz; Alexander Wolff: Two-Sided Boundary Labeling with Adjacent Sides, in Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13), pp. 233-236, Abstract

Sonstiges

• Philipp Kindermann; Lena Schlipf; André Schulz: On Gallai's conjecture for series-parallel graphs and planar 3-trees, in CoRR, Vol. abs/1706.04130, 2017
• Patrizio Angelini; Michael A. Bekos; Michael Kaufmann; Philipp Kindermann; Thomas Schneck: Fan-Bundle-Planar Drawings of Graphs, in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD'16), pp. 634-636, Poster
• Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends, in Proceedings of the 23rd International Symposium on Graph Drawing (GD'14), pp. 515-516, Poster