piwik-script

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

    Dr. Philipp Kindermann

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

    Büro: E14
    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 Oktober 2018:
      Akademischer Rat 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

    2018

    • 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).
       
    • 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).
       
    • 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).
       
    • 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). p. 230--246. University of Manitoba (2018).
       
    • 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). Springer-Verlag (2018).
       
    • 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). Springer-Verlag (2018).
       
    • 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).
       
    • 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).
       
    • 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--53:6. FU Berlin (2018).
       
    • 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).
       

    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.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17). p. 52--64. Springer-Verlag (2017).
       
    • 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).
       
    • 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. Springer-Verlag (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.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17). p. 113--126. Springer (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.) Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD'17). p. 517--530. Springer-Verlag (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.) Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC'17). p. 4:1--4:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017).
       

    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).
       
    • 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).
       
    • 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).
       
    • 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).
       
    • 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., 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.) Proceedings of the 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í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. 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.) Proceedings 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 (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.) Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15). 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.) Proceedings of the 13th International Algorithms and Data Structure Symposium (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.) Proceedings of the 29th European Workshop on Computational Geometry (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).
       

    Hinweis zum Datenschutz

    Mit 'OK' verlassen Sie die Seiten der Universität Würzburg und werden zu Facebook weitergeleitet. Informationen zu den dort erfassten Daten und deren Verarbeitung finden Sie in deren Datenschutzerklärung.

    Hinweis zum Datenschutz

    Mit 'OK' verlassen Sie die Seiten der Universität Würzburg und werden zu Twitter weitergeleitet. Informationen zu den dort erfassten Daten und deren Verarbeitung finden Sie in deren Datenschutzerklärung.

    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. Z8
    Hubland Süd, Geb. M2
    Hubland Süd, Geb. M2