piwik-script

Deutsch Intern
    Chair of Computer Science I - Algorithms and Complexity

    Prof. Dr. Philipp Kindermann

    Lehrstuhl für Informatik I
    Universität Würzburg
    Am Hubland
    D-97074 Würzburg

    Office: 00.003, Building M4
    Phone: +49 (0) 931-31-86811

    Email: philipp.kindermann@uni-wuerzburg.de

    orcid.org/0000-0001-5764-7719

    Office hours: Wednesday 14:00 - 15:00 (and by appointment)

    Teaching

    Research

    • Graph Drawing
    • Graph Algorithms
    • Computational Geometry

    Work in Committees

    Short CV

    • from April 2021:
      Assisstant professorship for Algorithms, University of Trier
    • März 2020 September 2020:
      Replacement professorship for Applied Machine Learning, University of Passau
    • since March 2019:
      Research associate (Akademischer Rat a.Z.) at Chair of Computer Science I, University of Würzburg
    • Oktober 2018 Februar 2019:
      Research assistant at Chair of Computer Science I, University of Würzburg
    • March 2018 – September 2018:
      Postdoctoral Fellow at David R. Cheriton School of Computer Science, University of Waterloo, Canada
    • September 2015 – February 2018:
      Research assistant at LG Theoretische Informatik, FernUniversität in Hagen
    • April 2015: 
      PhD in Computer Science, University of Würzburg
    • November 2011 – August 2015:
      Research assistant at Chair of Computer Science I, University of Würzburg
    • 2006 – 2011:
      Studies of computer science at University of Würzburg

    Scholarships and Awards

      • September 2017:
        Best Presentation Award, GD 2017, Boston, MA
      • September 2016:
        2nd Place Best Poster Award, GD 2016, Athen
      • Dezember 2015:
        Travel Grant from the DAAD
      • September 2014:
        1st Place Graph Drawing Challenge, GD 2014, Würzburg
        Category: Manual Graph Drawing
      • February 2014: 
        Jubiläumsstiftung Universität Würzburg

    Publications

    You can also find a list of my publications at DBLP and Google Scholar.

     

    Article in journal, newspaper, or magazine [ to top ]

    • 1.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Recognizing Stick Graphs with and without Length Constraints. Journal of Graph Algorithms and Applications. 24, 657–681 (2020).
       
    • 2.
      Kindermann, P., Montecchiani, F., Schlipf, L., Schulz, A.: Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. Journal of Graph Algorithms and Applications. 25, 1–28 (2020).
       
    • 3.
      Angelini, P., Bekos, M., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., Tappini, A.: Greedy Rectilinear Drawings. Theoretical Computer Science. 795, 375–397 (2019).
       
    • 4.
      Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., Vogtenhuber, B.: Lombardi Drawings of Knots and Links. Journal of Computational Geometry. 10, 444–476 (2019).
       
    • 5.
      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).
       
    • 6.
      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).
       
    • 7.
      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).
       
    • 8.
      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).
       
    • 9.
      Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-Fan-Bundle-Planar Drawings of Graphs. Theoretical Computer Science. 723, 23–50 (2018).
       
    • 10.
      Angelini, P., Lozzo, G.D., Battista, G.D., Donato, V.D., Kindermann, P., Rote, G., Rutter, I.: Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. Transactions on Algorithms. 14, 54:1–54:24 (2018).
       
    • 11.
      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).
       
    • 12.
      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).
       
    • 13.
      Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and Drawing IC-Planar Graphs. Theoretical Computer Science. 636, 1–16 (2016).
       
    • 14.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-Sided Boundary Labeling. Algorithmica. 76, 225–258 (2016).
       

    Article in Conference Proceedings [ to top ]

    • 1.
      Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., Wolff, A.: Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In: Philippou, A. and Georgiou, C. (eds.) Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC’21) (2021).
       
    • 2.
      Angelini, P., Bekos, M., Kindermann, P., Mchedlidze, T.: On Mixed Linear Layouts of Series-Parallel Graphs. In: Auber, D. and Valtr, P. (eds.) Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (2020).
       
    • 3.
      Angelini, P., Kindermann, P., Löffler, A., Schlipf, L., Symvonis, A.: One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. In: Chaplick, S., Kindermann, P., and Wolff, A. (eds.) Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20). pp. 70:1–70:6. Würzburg (2020).
       
    • 4.
      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).
       
    • 5.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Chaplick, S., Kindermann, P., and Wolff, A. (eds.) Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20). pp. 67:1–67:8. Würzburg (2020).
       
    • 6.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Auber, D. and Valtr, P. (eds.) Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (2020).
       
    • 7.
      Chimani, M., Kindermann, P., Montecchiani, F., Valtr, P.: Crossing Numbers of Beyond-Planar Graphs. In: Archambault, D. and Tóth, C.D. (eds.) Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19). pp. 78–86. Springer-Verlag (2019).
       
    • 8.
      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).
       
    • 9.
      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 Graph-Theoretic Concepts in Computer Science (WG’19). pp. 258–270. Springer-Verlag (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). pp. 416–429. Springer-Verlag (2019).
       
    • 11.
      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).
       
    • 12.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Height-Optimal 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). pp. 203–215. Springer-Verlag (2019).
       
    • 13.
      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). pp. 575–583. Springer-Verlag (2019).
       
    • 14.
      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). pp. 23:1–23:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019).
       
    • 15.
      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). pp. 3–17. Springer-Verlag (2019).
       
    • 16.
      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).
       
    • 17.
      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). pp. 53:1–53:6. FU Berlin (2018).
       
    • 18.
      Kindermann, P., Montecchiani, F., Schlipf, L., Schulz, A.: Drawing Subcubic 1-Planar 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). pp. 152–166. Springer-Verlag (2018).
       
    • 19.
      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). pp. 609–617. Springer-Verlag (2018).
       
    • 20.
      Biedl, T., Biniaz, A., Irvine, V., Kindermann, P., Naredla, A.M., Turcotte, A.: Integral Unit Bar-Visibility Graphs. In: Durocher, S. and Kamali, S. (eds.) Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG’18). pp. 230–246. University of Manitoba (2018).
       
    • 21.
      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). pp. 495–508. Springer-Verlag (2018).
       
    • 22.
      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 Graph-Theoretic Concepts in Computer Science (WG’17). pp. 316–329. Springer-Verlag (2017).
       
    • 23.
      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). pp. 4:1–4:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017).
       
    • 24.
      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). pp. 113–126. Springer (2017).
       
    • 25.
      Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: 1-Fan-Bundle-Planar 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). pp. 517–530. Springer-Verlag (2017).
       
    • 26.
      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). pp. 575–582. Springer-Verlag (2017).
       
    • 27.
      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). pp. 52–64. Springer-Verlag (2017).
       
    • 28.
      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). pp. 55–58. Lugano (2016).
       
    • 29.
      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). pp. 589–595. Springer-Verlag (2016).
       
    • 30.
      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). pp. 403–415. Springer-Verlag (2016).
       
    • 31.
      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). pp. 532–545. Springer-Verlag (2016).
       
    • 32.
      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). pp. 59–62. Lugano (2016).
       
    • 33.
      Angelini, P., Da Lozzo, G., Di Battista, G., Di Donato, V., Kindermann, P., Rote, G., Rutter, I.: Windrose Planarity – Embedding Graphs with Direction-Constrained Edges. In: Krauthgamer, R. (ed.) Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’16). pp. 985–996. SIAM (2016).
       
    • 34.
      Angelini, P., Bekos, M.A., Kaufmann, M., Kindermann, P., Schneck, T.: Fan-Bundle-Planar 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). pp. 634–636. Springer-Verlag (2016).
       
    • 35.
      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). pp. 37:1–37:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016).
       
    • 36.
      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).
       
    • 37.
      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). pp. 531–537. Springer (2015).
       
    • 38.
      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). pp. 105–119. Springer-Verlag (2015).
       
    • 39.
      Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. In: Rahman, M. and Tomita, E. (eds.) Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM’15). pp. 222–233. Springer-Verlag (2015).
       
    • 40.
      Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored Non-Crossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15). pp. 429–441. Springer-Verlag (2015).
       
    • 41.
      Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and Drawing IC-Planar Graphs. In: Di Giacomo, E. and Lubiw, A. (eds.) Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD’15). pp. 295–308. Springer-Verlag (2015).
       
    • 42.
      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). pp. 488–500. Springer-Verlag (2014).
       
    • 43.
      Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. In: Duncan, C. and Symvonis, A. (eds.) Proceedings of the 22nd International Symposium on Graph Drawing (GD’14). pp. 515–516. Springer-Verlag (2014).
       
    • 44.
      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). pp. 76–88. Springer-Verlag (2014).
       
    • 45.
      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). pp. 87–99. Springer-Verlag (2014).
       
    • 46.
      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). pp. 144–155. Springer-Verlag (2014).
       
    • 47.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Dehne, F., Solis-Oba, R., and Sack, J.-R. (eds.) Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13). pp. 463–474. Springer-Verlag (2013).
       
    • 48.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Fekete, S. (ed.) Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13). pp. 233–236. , Braunschweig (2013).
       

    PhD or Master Thesis [ to top ]

    • 1.
      Kindermann, P.: Angular Schematization in Graph Drawing, https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/11254, (2015).
       
    • 2.
      Kindermann, P.: Vehicle Routing with Time Constraints and Different Vehicles, http://www1.informatik.uni-wuerzburg.de/pub/theses/2011-kindermann-diplom.pdf, (2011).