Dr. Philipp Kindermann
Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
D97074 Würzburg
Raum: 00.003, Gebäude M4
Telefon: +49 (0) 9313186811
Email: philipp.kindermann@uniwuerzburg.de
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
 März 2020 – September 2020:
Vertretungsprofessur für Angewandtes Maschinelles Lernen, Universität Passau  seit März 2019:
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.
Artikel in einem Journal, einer Zeitung oder einem Magazin [ nach oben ]

1.Angelini, P., Bekos, M., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., Tappini, A.: Greedy Rectilinear Drawings. Theoretical Computer Science. (2019).

2.Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., Vogtenhuber, B.: Lombardi Drawings of Knots and Links. Journal of Computational Geometry. (2019).

3.Eppstein, D., Kindermann, P., Kobourov, S., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., Wismath, S.: On the Planar Split Thickness of Graphs. Algorithmica. 80, 977–994 (2018).

4.Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1FanBundlePlanar Drawings of Graphs. Theoretical Computer Science. 723, 23–50 (2018).

5.Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. Journal of Graph Algorithms and Applications. 22, 501–518 (2018).

6.Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., Stehn, F.: Placing your Coins on a Shelf. Journal of Computational Geometry. 9, 312–327 (2018).

7.Angelini, P., Lozzo, G.D., Battista, G.D., Donato, V.D., Kindermann, P., Rote, G., Rutter, I.: Windrose Planarity: Embedding Graphs with DirectionConstrained Edges. Transactions on Algorithms. 14, 54:1– (2018).

8.Hültenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing Planar Graphs with Few Geometric Primitives. Journal of Graph Algorithms and Applications. 22, 357–387 (2018).

9.Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. Algorithmica. 77, 902–920 (2017).

10.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right–Angle Crossings and Few Bends. Journal of Graph Algorithms and Applications. 20, 133–158 (2016).

11.Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and Drawing ICPlanar Graphs. Theoretical Computer Science. 636, 1–16 (2016).

12.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: MultiSided Boundary Labeling. Algorithmica. 76, 225–258 (2016).
Artikel in Konferenzband [ nach oben ]

1.Kindermann, P., Mchedlidze, T., Meulemans, W., Rutter, I.: Graph Drawing Contest Report. In: Auber, D. and Valtr, P. (eds.) Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (2020).[ BibTeX ]

2.Biedl, T., Biniaz, A., Irvine, V., Jain, K., Kindermann, P., Lubiw, A.: Maximum Matchings and Minimum Blocking Sets in \($\Theta_6$\)Graphs. In: Sau, I. and Thilikos, D.M. (eds.) Proceedings of the 45th International Workshop on GraphTheoretic Concepts in Computer Science (WG’19). p. 258–270. SpringerVerlag (2019).

3.Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. In: Löffler, M. (ed.) Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19). Utrecht (2019).

4.Biedl, T., Biniaz, A., Irvine, V., Jain, K., Kindermann, P., Lubiw, A.: Maximum Matchings and Minimum Blocking Sets in \($\Theta_6$\)Graphs. In: Löffler, M. (ed.) Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19). Utrecht (2019).

5.Chimani, M., Kindermann, P., Montecchiani, F., Valtr, P.: Crossing Numbers of BeyondPlanar Graphs. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). SpringerVerlag (2019).

6.Biedl, T., Kindermann, P.: Finding Tutte Paths in Linear Time. In: Baier, C., Chatzigiannakis, I., Flocchini, P., and Leonardi, S. (eds.) Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19). p. 23:1–. Schloss Dagstuhl  LeibnizZentrum fuer Informatik (2019).

7.Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). SpringerVerlag (2019).

8.Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing HeightOptimal Tangles Faster. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). SpringerVerlag (2019).

9.Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. In: Cheng, S.W. (ed.) Proceedings of the 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC’19). Seoul (2019).

10.Kindermann, P., Mchedlidze, T., Schneck, T., Symvonis, A.: Drawing Planar Graphs with Few Segments on a Polynomial Grid. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). SpringerVerlag (2019).

11.Kindermann, P., Mchedlidze, T., Rutter, I.: Graph Drawing Contest Report. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). SpringerVerlag (2019).

12.Devanny, W., Kindermann, P., Löffler, M., Rutter, I.: Graph Drawing Contest Report. In: Biedl, T. and Kerren, A. (eds.) Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18). p. 609–617. SpringerVerlag (2018).

13.Kindermann, P., Klemz, B., Rutter, I., Schnider, P., Schulz, A.: The Partition Spanning Forest Problem. In: Mulzer, W. (ed.) Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18). p. 53:1–. FU Berlin (2018).

14.Biedl, T., Biniaz, A., Irvine, V., Kindermann, P., Naredla, A.M., Turcotte, A.: Integral Unit BarVisibility Graphs. In: Durocher, S. and Kamali, S. (eds.) Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG’18). p. 230–246. University of Manitoba (2018).

15.Angelini, P., Bekos, M., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., Tappini, A.: Greedy Rectilinear Drawings. In: Biedl, T. and Kerren, A. (eds.) Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18). p. 495–508. SpringerVerlag (2018).

16.Kindermann, P., Montecchiani, F., Schlipf, L., Schulz, A.: Drawing Subcubic 1Planar Graphs with Few Bends, Few Slopes, and Large Angles. In: Biedl, T. and Kerren, A. (eds.) Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18). p. 152–166. SpringerVerlag (2018).

17.Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., Vogtenhuber, B.: Lombardi Drawings of Knots and Links. In: Frati, F. and Ma, K.L. (eds.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17). p. 113–126. Springer (2017).

18.Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. In: Frati, F. and Ma, K.L. (eds.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17). p. 52–64. SpringerVerlag (2017).

19.Devanny, W., Kindermann, P., Löffler, M., Rutter, I.: Graph Drawing Contest Report. In: Frati, F. and Ma, K.L. (eds.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17). p. 575–582. SpringerVerlag (2017).

20.Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., Stehn, F.: Placing your Coins on a Shelf. In: Okamoto, Y. and Tokuyama, T. (eds.) Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC’17). p. 4:1–. Schloss Dagstuhl  LeibnizZentrum fuer Informatik (2017).

21.Hültenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing Planar Graphs with Few Geometric Primitives. In: Bodlaender, H.L. and Woeginger, G.J. (eds.) Proceedings of the 43rd International Workshop on GraphTheoretic Concepts in Computer Science (WG’17). p. 316–329. SpringerVerlag (2017).

22.Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1FanBundlePlanar Drawings of Graphs. In: Frati, F. and Ma, K.L. (eds.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17). p. 517–530. SpringerVerlag (2017).

23.Angelini, P., Da Lozzo, G., Di Battista, G., Di Donato, V., Kindermann, P., Rote, G., Rutter, I.: Windrose Planarity – Embedding Graphs with DirectionConstrained Edges. In: Krauthgamer, R. (ed.) Proceedings of the 27th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’16). p. 985–996. SIAM (2016).

24.Eppstein, D., Kindermann, P., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., Wismath, S.: On the Planar Split Thickness of Graphs. In: Kranakis, E., Navarro, G., and Chávez, E. (eds.) Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN’16). p. 403–415. SpringerVerlag (2016).

25.Hültenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing Trees and Triangulations with Few Geometric Primitives. In: Barequet, G. and Papadopoulou, E. (eds.) Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16). p. 55–58. Lugano (2016).

26.Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: FanBundlePlanar Drawings of Graphs. In: Hu, Y. and Nöllenburg, M. (eds.) Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16). p. 634–636. SpringerVerlag (2016).

27.Kindermann, P., Löffler, M., Nachmanson, L., Rutter, I.: Graph Drawing Contest Report. In: Hu, Y. and Nöllenburg, M. (eds.) Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16). p. 589–595. SpringerVerlag (2016).

28.Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., Scheucher, M.: Strongly Monotone Drawings of Planar Graphs. In: Fekete, S. and Lubiw, A. (eds.) Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16). p. 37:1–. Schloss Dagstuhl  LeibnizZentrum fuer Informatik (2016).

29.Angelini, P., Chaplick, S., Cornelse, S., Lozzo, G.D., Battista, G.D., Eades, P., Kindermann, P., Kratochvíl, J., Lipp, F., Rutter, I.: Simultaneous Orthogonal Planarity. In: Hu, Y. and Nöllenburg, M. (eds.) Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16). p. 532–545. SpringerVerlag (2016).

30.Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., Scheucher, M.: Strongly Monotone Drawings of Planar Graphs. In: Barequet, G. and Papadopoulou, E. (eds.) Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16). p. 59–62. Lugano (2016).

31.Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and Drawing ICPlanar Graphs. In: Di Giacomo, E. and Lubiw, A. (eds.) Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD’15). p. 295–308. SpringerVerlag (2015).

32.Chaplick, S., Kindermann, P., Lipp, F., Wolff, A.: Solving Optimization Problems on Orthogonal Ray Graphs. Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15). p. 2 pp (2015).

33.Kindermann, P., Löffler, M., Nachmanson, L., Rutter, I.: Graph Drawing Contest Report. In: Giacomo, E.D. and Lubiw, A. (eds.) Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD’15). p. 531–537. Springer (2015).

34.Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.S., Wolff, A.: Minimum Rectilinear Polygons for Given Angle Sequences. Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15). p. 105–119. SpringerVerlag (2015).

35.Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored NonCrossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15). p. 429–441. SpringerVerlag (2015).

36.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. In: Rahman, M. and Tomita, E. (eds.) Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM’15). p. 222–233. SpringerVerlag (2015).

37.Kindermann, P., Lipp, F., Wolff, A.: Luatodonotes: Boundary Labeling for Annotations in Texts. In: Duncan, C. and Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD’14). p. 76–88. SpringerVerlag (2014).

38.Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. In: Schulz, A.S. and Wagner, D. (eds.) Proceedings of the 22nd European Symposium on Algorithms (ESA’14). p. 87–99. SpringerVerlag (2014).

39.Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On Monotone Drawings of Trees. In: Duncan, C. and Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD’14). p. 488–500. SpringerVerlag (2014).

40.Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth Orthogonal Drawings of Planar Graphs. In: Pardo, A. and Viola, A. (eds.) Proc. 11th Latin American Sympos. on Theoretical Informatics (LATIN’14). p. 144–155. SpringerVerlag (2014).

41.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. In: Duncan, C. and Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD’14). p. 515–516. SpringerVerlag (2014).

42.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: TwoSided Boundary Labeling with Adjacent Sides. In: Dehne, F., SolisOba, R., and Sack, J.R. (eds.) Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13). p. 463–474. SpringerVerlag (2013).

43.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: TwoSided Boundary Labeling with Adjacent Sides. In: Fekete, S. (ed.) Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13). p. 233–236. , Braunschweig (2013).
Dissertation oder Abschlussarbeit [ nach oben ]

1.Kindermann, P.: Angular Schematization in Graph Drawing, https://opus.bibliothek.uniwuerzburg.de/frontdoor/index/index/docId/11254, (2015).

2.Kindermann, P.: Vehicle Routing with Time Constraints and Different Vehicles, http://www1.informatik.uniwuerzburg.de/pub/theses/2011kindermanndiplom.pdf, (2011).