Prof. Dr. Philipp Kindermann

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
D-97074 Würzburg
Raum: 00.003, Gebäude M4
Telefon: +49 (0) 931-31-86811
Email: philipp.kindermann@uni-wuerzburg.de
orcid.org/0000-0001-5764-7719
Sprechstunde: Mittwoch 14:00 - 15:00 (und nach Absprache)
Lehrveranstaltungen
- WS 20/21: Vorlesung Algorithmische Geometrie (auf YouTube)
- SS 20: Vorlesung Approximationsalgorithmen (auf YouTube)
- SS 20: Vorlesung Algorithmische Geometrie (auf YouTube)
- WS 19/20: Vorlesung Approximationsalgorithmen
- WS 19/20: Seminar Visualisierung von Graphen
- SS 19: Vorlesung Algorithmen für geographische Informationssysteme
- SS 19: Seminar Algorithmen für Programmierwettbewerbe
- WS 18/19: Vorlesung Algorithmische Geometrie
- WS 18/19: Seminar Visualisierung von Graphen
- SS 18: Vorlesung CS136: Elementary Algorithm Design and Data Abstraction
- WS 16/17: Seminar Graphenzeichnen
- WS 15/16: Seminar Graphenzeichnen
- SS 15: Übungen zu Algorithmische Graphentheorie
- SS 15: Seminar Entwurf und Analyse von Datenstrukturen
- WS 14/15: Übungen zu Algorithmische Geometrie
- SS 14: Vorlesung Visualisierung von Graphen
- WS 13/14: Übungen zu Algorithmische Geometrie
- WS 12/13: Schlüsselqualifikation Standard Office Software für Fortgeschrittene II
- SS 12: Schlüsselqualifikation Standard Office Software für Fortgeschrittene I
- WS 11/12: Schlüsselqualifikation Standard Office Software für Fortgeschrittene II
Forschung
- Graphenzeichnen
- Graphalgorithmen
- Algorithmische Geometrie
Mitgliedschaft in Ausschüssen
- 2021: Programmausschuss PacificVis 2021 - Visualization Notes
- 2021: Programmausschuss Computational Geometry: Media Exposition (Teil von SoCG 2021)
- 2020 –: Beratungsausschuss Computational Geometry Challenge
- 2020: Programmausschuss Graph Drawing and Network Visualization (GD 2020)
- 2020: Vorsitz Programmausschuss European Workshop on Computational Geometry (EuroCG 2020)
- 2018: Programmausschuss Iranian Conference on Computational Geometry (ICCG 2019)
- 2015 –: Graph Drawing Contest Committee (Vorsitz seit 2018)
- 2014: Organisationsausschuss Graph Drawing (GD 2014)
Werdegang
- ab April 2021:
Juniorprofessur für Algorithmik, Universität Trier - März 2020 – September 2020:
Vertretungsprofessur für Angewandtes Maschinelles Lernen, Universität Passau - März 2019 – März 2021:
Akademischer Rat a. Z. am Lehrstuhl für Informatik I, Universität Würzburg - Oktober 2018 – Februar 2019:
Wissenschaftlicher Mitarbeiter am Lehrstuhl für Informatik I, Universität Würzburg - März 2018 – September 2018:
PostDoctoral Fellow an der David R. Cheriton School of Computer Science, University of Waterloo, Canada - September 2015 – Februar 2018:
Wissenschaftlicher Mitarbeiter am LG Theoretische Informatik, FernUniversität in Hagen - April 2015:
Promotion, Institut für Informatik, Universität Würzburg - November 2011 – August 2015:
Wissenschaftlicher Mitarbeiter am Lehrstuhl für Informatik I, Universität Würzburg - 2006 – 2011:
Studium der Informatik an der Universität Würzburg
Stipendien und Auszeichnungen
- September 2017:
Best Presentation Award, GD 2017, Boston, MA - September 2016:
2. Platz Best Poster Award, GD 2016, Athen - Dezember 2015:
Reiseförderung der DAAD - September 2014:
1. Platz Graph Drawing Challenge, GD 2014, Würzburg
Kategorie: Manuelles Graphenzeichnen - Februar 2014:
Jubiläumsstiftung Universität Würzburg
Veröffentlichungen
Eine Liste meiner Veröffentlichungen gibt es auch bei DBLP und Google Scholar.
- [ Article ]
- [ Inproceedings ]
- [ Mastersthesis ]
- [ PhD thesis ]
Article[ to top ]
-
Recognizing Stick Graphs with and without Length Constraints in Journal of Graph Algorithms and Applications (2020). 24(4) 657–681.
-
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles in Journal of Graph Algorithms and Applications (2020). 25(1) 1–28.
-
Greedy Rectilinear Drawings in Theoretical Computer Science (2019). 795 375–397.
-
Lombardi Drawings of Knots and Links in Journal of Computational Geometry (2019). 10(1) 444–476.
-
On the Planar Split Thickness of Graphs in Algorithmica (2018). 80(3) 977–994.
-
Drawing Planar Graphs with Few Geometric Primitives in Journal of Graph Algorithms and Applications (2018). 22(2) 357–387.
-
Placing your Coins on a Shelf in Journal of Computational Geometry (2018). 9(1) 312–327.
-
Experimental analysis of the accessibility of drawings with few segments in Journal of Graph Algorithms and Applications (2018). 22(3) 501–518.
-
1-Fan-Bundle-Planar Drawings of Graphs in Theoretical Computer Science (2018). 723 23–50.
-
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges in Transactions on Algorithms (2018). 14(4) 54:1–54:24.
-
Improved Approximation Algorithms for Box Contact Representations in Algorithmica (2017). 77(3) 902–920.
-
Simultaneous Drawing of Planar Graphs with Right–Angle Crossings and Few Bends in Journal of Graph Algorithms and Applications (2016). 20(1) 133–158.
-
Recognizing and Drawing IC-Planar Graphs in Theoretical Computer Science (2016). 636 1–16.
-
Multi-Sided Boundary Labeling in Algorithmica (2016). 76(1) 225–258.
Inproceedings[ to top ]
-
Extending Partial Representations of Rectangular Duals with Given Contact Orientations in Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC’21), A. Philippou, C. Georgiou (eds.) (2021).
-
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (eds.) (2020). 70:1–70:6.
-
The Complexity of Finding Tangles in Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
-
The Complexity of Finding Tangles in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (eds.) (2020). 67:1–67:8.
-
Graph Drawing Contest Report in Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
-
On Mixed Linear Layouts of Series-Parallel Graphs in Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
-
Computing Optimal Tangles Faster in Proceedings of the 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC’19), S.-W. Cheng (ed.) (2019).
-
Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs in Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’19), Lecture Notes in Computer Science, I. Sau, D. M. Thilikos (eds.) (2019). (Vol. 11789) 258–270.
-
Finding Tutte Paths in Linear Time in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19), LIPIcs, C. Baier, I. Chatzigiannakis, P. Flocchini, S. Leonardi (eds.) (2019). (Vol. 132) 23:1–23:14.
-
Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (ed.) (2019).
-
Stick Graphs with Length Constraints in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 3–17.
-
Crossing Numbers of Beyond-Planar Graphs in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 78–86.
-
Drawing Planar Graphs with Few Segments on a Polynomial Grid in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 416–429.
-
Computing Height-Optimal Tangles Faster in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 203–215.
-
Graph Drawing Contest Report in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 575–583.
-
Computing Optimal Tangles Faster in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (ed.) (2019).
-
Graph Drawing Contest Report in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 609–617.
-
Integral Unit Bar-Visibility Graphs in Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG’18), S. Durocher, S. Kamali (eds.) (2018). 230–246.
-
Greedy Rectilinear Drawings in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 495–508.
-
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 152–166.
-
The Partition Spanning Forest Problem in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), W. Mulzer (ed.) (2018). 53:1–53:6.
-
Placing your Coins on a Shelf in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC’17), Y. Okamoto, T. Tokuyama (eds.) (2017). (Vol. 92) 4:1–4:12.
-
Drawing Planar Graphs with Few Geometric Primitives in Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’17), Lecture Notes in Computer Science, H. L. Bodlaender, G. J. Woeginger (eds.) (2017). (Vol. 10520) 316–329.
-
1-Fan-Bundle-Planar Drawings of Graphs in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 517–530.
-
Lombardi Drawings of Knots and Links in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 113–126.
-
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), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 52–64.
-
Graph Drawing Contest Report in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 575–582.
-
Drawing Trees and Triangulations with Few Geometric Primitives in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), G. Barequet, E. Papadopoulou (eds.) (2016). 55–58.
-
Graph Drawing Contest Report in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 589–595.
-
On the Planar Split Thickness of Graphs in Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN’16), Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{\’{a}}vez (eds.) (2016). (Vol. 9644) 403–415.
-
Simultaneous Orthogonal Planarity in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 532–545.
-
Strongly Monotone Drawings of Planar Graphs in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), G. Barequet, E. Papadopoulou (eds.) (2016). 59–62.
-
Windrose Planarity – Embedding Graphs with Direction-Constrained Edges in Proceedings of the 27th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA’16), R. Krauthgamer (ed.) (2016). 985–996.
-
Fan-Bundle-Planar Drawings of Graphs in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 634–636.
-
Strongly Monotone Drawings of Planar Graphs in Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16), LIPIcs, S. Fekete, A. Lubiw (eds.) (2016). (Vol. 51) 37:1–37:15.
-
Graph Drawing Contest Report in Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD’15), Lecture Notes in Computer Science, E. D. Giacomo, A. Lubiw (eds.) (2015). (Vol. 9411) 531–537.
-
Solving Optimization Problems on Orthogonal Ray Graphs in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15) (2015). 2 pp.
-
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), Lecture Notes in Computer Science, M. Rahman, E. Tomita (eds.) (2015). (Vol. 8973) 222–233.
-
Colored Non-Crossing Euclidean Steiner Forest in Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15), Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.) (2015). (Vol. 9472) 429–441.
-
Minimum Rectilinear Polygons for Given Angle Sequences in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15), Lecture Notes in Computer Science (2015). (Vol. 9943) 105–119.
-
Recognizing and Drawing IC-Planar Graphs in Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD’15), Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.) (2015). (Vol. 9411) 295–308.
-
On Monotone Drawings of Trees in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 488–500.
-
Luatodonotes: Boundary Labeling for Annotations in Texts in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 76–88.
-
Improved Approximation Algorithms for Box Contact Representations in Proceedings of the 22nd European Symposium on Algorithms (ESA’14), Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (eds.) (2014). (Vol. 8737) 87–99.
-
Smooth Orthogonal Drawings of Planar Graphs in Proc. 11th Latin American Sympos. on Theoretical Informatics (LATIN’14), Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.) (2014). (Vol. 8392) 144–155.
-
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 515–516.
-
Two-Sided Boundary Labeling with Adjacent Sides in Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13), Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (eds.) (2013). (Vol. 8037) 463–474.
-
Two-Sided Boundary Labeling with Adjacent Sides in Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13), S. Fekete (ed.) (2013). 233–236.
Mastersthesis[ to top ]
-
Vehicle Routing with Time Constraints and Different Vehicles PhD thesis, Lehrstuhl f\"ur Informatik I, Universit\"at W\"urzburg. (2011, October).
PhD thesis[ to top ]
-
Angular Schematization in Graph Drawing PhD thesis, Fakultät für Mathematik und Informatik, Universität Würzburg. (2015, June).