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

    Dr. Philipp Kindermann

    Lehrveranstaltungen

    Forschung

    • Graphenzeichnen
    • Graphalgorithmen
    • Algorithmische Geometrie
    • Orthogonale Layouts

    Werdegang

    • seit September 2015:
      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 2014:
      1. Platz Graph Drawing Challenge, GD 2014, Würzburg
      Kategorie: Manuelles Graphzeichnen
    • Februar 2014:
      Jubiläumsstiftung Universität Würzburg

    Mitgliedschaft in Ausschüssen

    • seit Februar 2015:
      Graph Drawing Contest Committee

    Veröffentlichungen

    2017

    • 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.) Proc. 28th International Symposium on Algorithms and Computation (ISAAC'17) (2017).
       
    • 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.) Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17) (2017).
       
    • 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.) Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17) (2017).
       
    • 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. 1--18 (2017).
       
    • Hültenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing Trees and Triangulations with Few Geometric Primitives. In: Bodlaender, H.L. and Woeginger, G.J. (eds.) Proc. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17) (2017).
       
    • Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. In: Frati, F. and Ma, K.-L. (eds.) Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17) (2017).
       

    2016

    • 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).
       
    • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-Sided Boundary Labeling. Algorithmica. 76, 225--258 (2016).
       
    • 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).
       
    • 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 (2016).
       
    • 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. Springer-Verlag (2016).
       
    • 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). p. 985--996. SIAM (2016).
       
    • 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).
       
    • 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. Springer-Verlag (2016).
       
    • 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.) Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16). p. 634--636. Springer-Verlag (2016).
       
    • Angelini, P., Chaplick, S., Cornelse, S., Lozzo, G.D., Battista, G.D., Eades, P., Kindermann, P., Kratochv'il, J., Lipp, F., Rutter, I.: Simultaneous Orthogonal Planarity. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16). p. 532--545. Springer-Verlag (2016).
       
    • 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).
       
    • 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.) Proeedings of the 32nd International Symposium on Computational Geometry (SoCG'16). p. 37:1--37:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016).
       

    2015

    • 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.S. and Tomita, E. (eds.) Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM'15). p. 222--233. Springer-Verlag (2015).
       
    • 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. Springer-Verlag, sep (2015).
       
    • 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).
       
    • 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). p. 295--308. Springer-Verlag (2015).
       
    • 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).
       
    • 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.) Proceecings of the 26th International Symposium on Algorithms and Computation (ISAAC 2015). p. 429--441. Springer-Verlag (2015).
       
    • Kindermann, P.: Angular Schematization in Graph Drawing, https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/11254, (2015).
       

    2014

    • 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. Springer-Verlag (2014).
       
    • 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. Springer-Verlag (2014).
       
    • 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. Springer-Verlag (2014).
       
    • 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. Springer-Verlag (2014).
       
    • 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). p. 515--516. Springer-Verlag (2014).
       

    2013

    • 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.) Proc. 13th Int. Algorithms Data Struct. Symp. (WADS'13). p. 463--474. Springer-Verlag (2013).
       
    • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13). p. 233--236. , Braunschweig (2013).
       

    2011

    • Kindermann, P.: Vehicle Routing with Time Constraints and Different Vehicles, http://www1.informatik.uni-wuerzburg.de/pub/theses/2011-kindermann-diplom.pdf, (2011).
       
    Kontakt

    Lehrstuhl für Informatik I (Effiziente Algorithmen und wissensbasierte Systeme)
    Am Hubland
    97074 Würzburg

    Tel.: +49 931 31-85054
    E-Mail

    Suche Ansprechpartner

    Hubland Süd, Geb. Z8 Hubland Süd, Geb. M2