piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen und Komplexität

    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

    Forschung

    • Graphenzeichnen
    • Graphalgorithmen
    • Algorithmische Geometrie

    Mitgliedschaft in Ausschüssen

    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.

    Artikel in einem Journal, einer Zeitung oder einem Magazin [ nach oben ]

    • 1.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., and Zink, J. (2020) Recognizing Stick Graphs with and without Length Constraints, Journal of Graph Algorithms and Applications 24, 657–681.
       
    • 2.
      Kindermann, P., Montecchiani, F., Schlipf, L., and Schulz, A. (2020) Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, Journal of Graph Algorithms and Applications 25, 1–28.
       
    • 3.
      Angelini, P., Bekos, M., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., and Tappini, A. (2019) Greedy Rectilinear Drawings, Theoretical Computer Science 795, 375–397.
       
    • 4.
      Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., and Vogtenhuber, B. (2019) Lombardi Drawings of Knots and Links, Journal of Computational Geometry 10, 444–476.
       
    • 5.
      Eppstein, D., Kindermann, P., Kobourov, S., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., and Wismath, S. (2018) On the Planar Split Thickness of Graphs, Algorithmica 80, 977–994.
       
    • 6.
      Hültenschmidt, G., Kindermann, P., Meulemans, W., and Schulz, A. (2018) Drawing Planar Graphs with Few Geometric Primitives, Journal of Graph Algorithms and Applications 22, 357–387.
       
    • 7.
      Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., and Stehn, F. (2018) Placing your Coins on a Shelf, Journal of Computational Geometry 9, 312–327.
       
    • 8.
      Kindermann, P., Meulemans, W., and Schulz, A. (2018) Experimental analysis of the accessibility of drawings with few segments, Journal of Graph Algorithms and Applications 22, 501–518.
       
    • 9.
      Angelini, P., Bekos, M. A., Kaufmann, M., Kindermann, P., and Schneck, T. (2018) 1-Fan-Bundle-Planar Drawings of Graphs, Theoretical Computer Science 723, 23–50.
       
    • 10.
      Angelini, P., Lozzo, G. D., Battista, G. D., Donato, V. D., Kindermann, P., Rote, G., and Rutter, I. (2018) Windrose Planarity: Embedding Graphs with Direction-Constrained Edges, Transactions on Algorithms 14, 54:1–54:24.
       
    • 11.
      Bekos, M. A., van Dijk, T. C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., and Wolff, A. (2017) Improved Approximation Algorithms for Box Contact Representations, Algorithmica 77, 902–920.
       
    • 12.
      Bekos, M. A., van Dijk, T. C., Kindermann, P., and Wolff, A. (2016) Simultaneous Drawing of Planar Graphs with Right–Angle Crossings and Few Bends, Journal of Graph Algorithms and Applications 20, 133–158.
       
    • 13.
      Brandenburg, F. J., Didimo, W., Evans, W. S., Kindermann, P., Liotta, G., and Montecchiani, F. (2016) Recognizing and Drawing IC-Planar Graphs, Theoretical Computer Science 636, 1–16.
       
    • 14.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., and Wolff, A. (2016) Multi-Sided Boundary Labeling, Algorithmica 76, 225–258.
       

    Artikel in Konferenzband [ nach oben ]

    • 1.
      Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., and Wolff, A. (2021) Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC’21) (Philippou, A., and Georgiou, C., Eds.).
       
    • 2.
      Angelini, P., Bekos, M., Kindermann, P., and Mchedlidze, T. (2020) On Mixed Linear Layouts of Series-Parallel Graphs. In Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (Auber, D., and Valtr, P., Eds.).
       
    • 3.
      Angelini, P., Kindermann, P., Löffler, A., Schlipf, L., and Symvonis, A. (2020) One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20) (Chaplick, S., Kindermann, P., and Wolff, A., Eds.), pp. 70:1–70:6, Würzburg.
       
    • 4.
      Kindermann, P., Mchedlidze, T., Meulemans, W., and Rutter, I. (2020) Graph Drawing Contest Report. In Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (Auber, D., and Valtr, P., Eds.).
       
    • 5.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., and Zink, J. (2020) The Complexity of Finding Tangles. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20) (Chaplick, S., Kindermann, P., and Wolff, A., Eds.), pp. 67:1–67:8, Würzburg.
       
    • 6.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., and Zink, J. (2020) The Complexity of Finding Tangles. In Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20) (Auber, D., and Valtr, P., Eds.).
       
    • 7.
      Chimani, M., Kindermann, P., Montecchiani, F., and Valtr, P. (2019) Crossing Numbers of Beyond-Planar Graphs. In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19) (Archambault, D., and Tóth, C. D., Eds.), pp. 78–86, Springer-Verlag.
       
    • 8.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., and Zink, J. (2019) Computing Optimal Tangles Faster. In Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19) (Löffler, M., Ed.), Utrecht.
       
    • 9.
      Biedl, T., Biniaz, A., Irvine, V., Jain, K., Kindermann, P., and Lubiw, A. (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) (Sau, I., and Thilikos, D. M., Eds.), pp. 258–270, Springer-Verlag.
       
    • 10.
      Kindermann, P., Mchedlidze, T., Schneck, T., and Symvonis, A. (2019) 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) (Archambault, D., and Tóth, C. D., Eds.), pp. 416–429, Springer-Verlag.
       
    • 11.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., and Zink, J. (2019) Computing Optimal Tangles Faster. In Proceedings of the 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC’19) (Cheng, S.-W., Ed.), Seoul.
       
    • 12.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., and Zink, J. (2019) Computing Height-Optimal Tangles Faster. In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19) (Archambault, D., and Tóth, C. D., Eds.), pp. 203–215, Springer-Verlag.
       
    • 13.
      Kindermann, P., Mchedlidze, T., and Rutter, I. (2019) Graph Drawing Contest Report. In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19) (Archambault, D., and Tóth, C. D., Eds.), pp. 575–583, Springer-Verlag.
       
    • 14.
      Biedl, T., and Kindermann, P. (2019) Finding Tutte Paths in Linear Time. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19) (Baier, C., Chatzigiannakis, I., Flocchini, P., and Leonardi, S., Eds.), pp. 23:1–23:14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
       
    • 15.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., and Zink, J. (2019) Stick Graphs with Length Constraints. In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19) (Archambault, D., and Tóth, C. D., Eds.), pp. 3–17, Springer-Verlag.
       
    • 16.
      Biedl, T., Biniaz, A., Irvine, V., Jain, K., Kindermann, P., and Lubiw, A. (2019) Maximum Matchings and Minimum Blocking Sets in \($\Theta_6$\)-Graphs. In Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19) (Löffler, M., Ed.), Utrecht.
       
    • 17.
      Kindermann, P., Klemz, B., Rutter, I., Schnider, P., and Schulz, A. (2018) The Partition Spanning Forest Problem. In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18) (Mulzer, W., Ed.), pp. 53:1–53:6, FU Berlin.
       
    • 18.
      Kindermann, P., Montecchiani, F., Schlipf, L., and Schulz, A. (2018) 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) (Biedl, T., and Kerren, A., Eds.), pp. 152–166, Springer-Verlag.
       
    • 19.
      Devanny, W., Kindermann, P., Löffler, M., and Rutter, I. (2018) Graph Drawing Contest Report. In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18) (Biedl, T., and Kerren, A., Eds.), pp. 609–617, Springer-Verlag.
       
    • 20.
      Biedl, T., Biniaz, A., Irvine, V., Kindermann, P., Naredla, A. M., and Turcotte, A. (2018) Integral Unit Bar-Visibility Graphs. In Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG’18) (Durocher, S., and Kamali, S., Eds.), pp. 230–246, University of Manitoba.
       
    • 21.
      Angelini, P., Bekos, M., Didimo, W., Grilli, L., Kindermann, P., Mchedlidze, T., Prutkin, R., Symvonis, A., and Tappini, A. (2018) Greedy Rectilinear Drawings. In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18) (Biedl, T., and Kerren, A., Eds.), pp. 495–508, Springer-Verlag.
       
    • 22.
      Hültenschmidt, G., Kindermann, P., Meulemans, W., and Schulz, A. (2017) Drawing Planar Graphs with Few Geometric Primitives. In Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’17) (Bodlaender, H. L., and Woeginger, G. J., Eds.), pp. 316–329, Springer-Verlag.
       
    • 23.
      Alt, H., Buchin, K., Chaplick, S., Cheong, O., Kindermann, P., Knauer, C., and Stehn, F. (2017) Placing your Coins on a Shelf. In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC’17) (Okamoto, Y., and Tokuyama, T., Eds.), pp. 4:1–4:12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
       
    • 24.
      Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., and Vogtenhuber, B. (2017) Lombardi Drawings of Knots and Links. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17) (Frati, F., and Ma, K.-L., Eds.), pp. 113–126, Springer.
       
    • 25.
      Angelini, P., Bekos, M. A., Kaufmann, M., Kindermann, P., and Schneck, T. (2017) 1-Fan-Bundle-Planar Drawings of Graphs. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17) (Frati, F., and Ma, K.-L., Eds.), pp. 517–530, Springer-Verlag.
       
    • 26.
      Devanny, W., Kindermann, P., Löffler, M., and Rutter, I. (2017) Graph Drawing Contest Report. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17) (Frati, F., and Ma, K.-L., Eds.), pp. 575–582, Springer-Verlag.
       
    • 27.
      Kindermann, P., Meulemans, W., and Schulz, A. (2017) 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) (Frati, F., and Ma, K.-L., Eds.), pp. 52–64, Springer-Verlag.
       
    • 28.
      Hültenschmidt, G., Kindermann, P., Meulemans, W., and Schulz, A. (2016) Drawing Trees and Triangulations with Few Geometric Primitives. In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16) (Barequet, G., and Papadopoulou, E., Eds.), pp. 55–58, Lugano.
       
    • 29.
      Kindermann, P., Löffler, M., Nachmanson, L., and Rutter, I. (2016) Graph Drawing Contest Report. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16) (Hu, Y., and Nöllenburg, M., Eds.), pp. 589–595, Springer-Verlag.
       
    • 30.
      Eppstein, D., Kindermann, P., Liotta, G., Lubiw, A., Maignan, A., Mondal, D., Vosoughpour, H., Whitesides, S., and Wismath, S. (2016) On the Planar Split Thickness of Graphs. In Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN’16) (Kranakis, E., Navarro, G., and Chávez, E., Eds.), pp. 403–415, Springer-Verlag.
       
    • 31.
      Angelini, P., Chaplick, S., Cornelse, S., Lozzo, G. D., Battista, G. D., Eades, P., Kindermann, P., Kratochvíl, J., Lipp, F., and Rutter, I. (2016) Simultaneous Orthogonal Planarity. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16) (Hu, Y., and Nöllenburg, M., Eds.), pp. 532–545, Springer-Verlag.
       
    • 32.
      Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., and Scheucher, M. (2016) Strongly Monotone Drawings of Planar Graphs. In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16) (Barequet, G., and Papadopoulou, E., Eds.), pp. 59–62, Lugano.
       
    • 33.
      Angelini, P., Da Lozzo, G., Di Battista, G., Di Donato, V., Kindermann, P., Rote, G., and Rutter, I. (2016) Windrose Planarity – Embedding Graphs with Direction-Constrained Edges. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’16) (Krauthgamer, R., Ed.), pp. 985–996, SIAM.
       
    • 34.
      Angelini, P., Bekos, M. A., Kaufmann, M., Kindermann, P., and Schneck, T. (2016) Fan-Bundle-Planar Drawings of Graphs. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16) (Hu, Y., and Nöllenburg, M., Eds.), pp. 634–636, Springer-Verlag.
       
    • 35.
      Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., and Scheucher, M. (2016) Strongly Monotone Drawings of Planar Graphs. In Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16) (Fekete, S., and Lubiw, A., Eds.), pp. 37:1–37:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
       
    • 36.
      Chaplick, S., Kindermann, P., Lipp, F., and Wolff, A. (2015) Solving Optimization Problems on Orthogonal Ray Graphs. In Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15), p. 2 pp.
       
    • 37.
      Kindermann, P., Löffler, M., Nachmanson, L., and Rutter, I. (2015) Graph Drawing Contest Report. In Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD’15) (Giacomo, E. D., and Lubiw, A., Eds.), pp. 531–537, Springer.
       
    • 38.
      Evans, W. S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.-S., and Wolff, A. (2015) Minimum Rectilinear Polygons for Given Angle Sequences. In Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15), pp. 105–119, Springer-Verlag.
       
    • 39.
      Bekos, M. A., van Dijk, T. C., Kindermann, P., and Wolff, A. (2015) 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) (Rahman, M., and Tomita, E., Eds.), pp. 222–233, Springer-Verlag.
       
    • 40.
      Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., and Wolff, A. (2015) Colored Non-Crossing Euclidean Steiner Forest. In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15) (Elbassioni, K., and Makino, K., Eds.), pp. 429–441, Springer-Verlag.
       
    • 41.
      Brandenburg, F. J., Didimo, W., Evans, W. S., Kindermann, P., Liotta, G., and Montecchiani, F. (2015) Recognizing and Drawing IC-Planar Graphs. In Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD’15) (Di Giacomo, E., and Lubiw, A., Eds.), pp. 295–308, Springer-Verlag.
       
    • 42.
      Kindermann, P., Schulz, A., Spoerhase, J., and Wolff, A. (2014) On Monotone Drawings of Trees. In Proceedings of the 22nd International Symposium on Graph Drawing (GD’14) (Duncan, C., and Symvonis, A., Eds.), pp. 488–500, Springer-Verlag.
       
    • 43.
      Bekos, M. A., van Dijk, T. C., Kindermann, P., and Wolff, A. (2014) Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. In Proceedings of the 22nd International Symposium on Graph Drawing (GD’14) (Duncan, C., and Symvonis, A., Eds.), pp. 515–516, Springer-Verlag.
       
    • 44.
      Kindermann, P., Lipp, F., and Wolff, A. (2014) Luatodonotes: Boundary Labeling for Annotations in Texts. In Proceedings of the 22nd International Symposium on Graph Drawing (GD’14) (Duncan, C., and Symvonis, A., Eds.), pp. 76–88, Springer-Verlag.
       
    • 45.
      Bekos, M. A., van Dijk, T. C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., and Wolff, A. (2014) Improved Approximation Algorithms for Box Contact Representations. In Proceedings of the 22nd European Symposium on Algorithms (ESA’14) (Schulz, A. S., and Wagner, D., Eds.), pp. 87–99, Springer-Verlag.
       
    • 46.
      Alam, M. J., Bekos, M. A., Kaufmann, M., Kindermann, P., Kobourov, S. G., and Wolff, A. (2014) Smooth Orthogonal Drawings of Planar Graphs. In Proc. 11th Latin American Sympos. on Theoretical Informatics (LATIN’14) (Pardo, A., and Viola, A., Eds.), pp. 144–155, Springer-Verlag.
       
    • 47.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., and Wolff, A. (2013) Two-Sided Boundary Labeling with Adjacent Sides. In Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13) (Dehne, F., Solis-Oba, R., and Sack, J.-R., Eds.), pp. 463–474, Springer-Verlag.
       
    • 48.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., and Wolff, A. (2013) Two-Sided Boundary Labeling with Adjacent Sides. In Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13) (Fekete, S., Ed.), pp. 233–236, Braunschweig.
       

    Dissertation oder Abschlussarbeit [ nach oben ]

    • 1.
      Kindermann, P. (2015, June) Angular Schematization in Graph Drawing, PhD dissertation.
       
    • 2.
      Kindermann, P. (2011, October) Vehicle Routing with Time Constraints and Different Vehicles, Master thesis, Lehrstuhl für Informatik I, Universität Würzburg.