piwik-script

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

    Prof. 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.

    Article[ to top ]
    • Recognizing Stick Graphs with and without Length Constraints Chaplick, Steven; Kindermann, Philipp; L{\"{o}}ffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Journal of Graph Algorithms and Applications (2020). 24(4) 657–681.
    • Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena; Schulz, André in Journal of Graph Algorithms and Applications (2020). 25(1) 1–28.
    • Greedy Rectilinear Drawings Angelini, Patrizio; Bekos, Michael; Didimo, Walter; Grilli, Luca; Kindermann, Philipp; Mchedlidze, Tamara; Prutkin, Roman; Symvonis, Antonios; Tappini, Alessandra in Theoretical Computer Science (2019). 795 375–397.
    • Lombardi Drawings of Knots and Links Kindermann, Philipp; Kobourov, Stephen; L{\"o}ffler, Maarten; N{\"o}llenburg, Martin; Schulz, Andr{\’e}; Vogtenhuber, Birgit in Journal of Computational Geometry (2019). 10(1) 444–476.
    • On the Planar Split Thickness of Graphs Eppstein, David; Kindermann, Philipp; Kobourov, Stephen; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen in Algorithmica (2018). 80(3) 977–994.
    • Drawing Planar Graphs with Few Geometric Primitives H{\"u}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{\’e} in Journal of Graph Algorithms and Applications (2018). 22(2) 357–387.
    • Placing your Coins on a Shelf Alt, Helmut; Buchin, Kevin; Chaplick, Steven; Cheong, Otfried; Kindermann, Philipp; Knauer, Christian; Stehn, Fabian in Journal of Computational Geometry (2018). 9(1) 312–327.
    • Experimental analysis of the accessibility of drawings with few segments Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{\’e} in Journal of Graph Algorithms and Applications (2018). 22(3) 501–518.
    • 1-Fan-Bundle-Planar Drawings of Graphs Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas in Theoretical Computer Science (2018). 723 23–50.
    • Windrose Planarity: Embedding Graphs with Direction-Constrained Edges Angelini, Patrizio; Lozzo, Giordano Da; Battista, Giuseppe Di; Donato, Valentino Di; Kindermann, Philipp; Rote, G{\"{u}}nter; Rutter, Ignaz in Transactions on Algorithms (2018). 14(4) 54:1–54:24.
    • Improved Approximation Algorithms for Box Contact Representations Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Algorithmica (2017). 77(3) 902–920.
    • Simultaneous Drawing of Planar Graphs with Right–Angle Crossings and Few Bends Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander in Journal of Graph Algorithms and Applications (2016). 20(1) 133–158.
    • Recognizing and Drawing IC-Planar Graphs Brandenburg, Franz J.; Didimo, Walter; Evans, William S.; Kindermann, Philipp; Liotta, Giuseppe; Montecchiani, Fabrizio in Theoretical Computer Science (2016). 636 1–16.
    • Multi-Sided Boundary Labeling Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{\’e}; Wolff, Alexander in Algorithmica (2016). 76(1) 225–258.
    Inproceedings[ to top ]
    • Extending Partial Representations of Rectangular Duals with Given Contact Orientations Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan; Rutter, Ignaz; Wolff, Alexander in Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC’21), A. Philippou, C. Georgiou (eds.) (2021).
    • One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons Angelini, Patrizio; Kindermann, Philipp; Löffler, Andre; Schlipf, Lena; Symvonis, Antonios in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (eds.) (2020). 70:1–70:6.
    • The Complexity of Finding Tangles Firman, Oksana; Felsner, Stefan; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
    • The Complexity of Finding Tangles Firman, Oksana; Felsner, Stefan; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (eds.) (2020). 67:1–67:8.
    • Graph Drawing Contest Report Kindermann, Philipp; Mchedlidze, Tamara; Meulemans, Wouter; Rutter, Ignaz in Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
    • On Mixed Linear Layouts of Series-Parallel Graphs Angelini, Patrizio; Bekos, Michael; Kindermann, Philipp; Mchedlidze, Tamara in Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD’20), D. Auber, P. Valtr (eds.) (2020).
    • Computing Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC’19), S.-W. Cheng (ed.) (2019).
    • Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika; Jain, Kshitij; Kindermann, Philipp; Lubiw, Anna in Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’19), Lecture Notes in Computer Science, I. Sau, D. M. Thilikos (eds.) (2019). (Vol. 11789) 258–270.
    • Finding Tutte Paths in Linear Time Biedl, Therese; Kindermann, Philipp in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19), LIPIcs, C. Baier, I. Chatzigiannakis, P. Flocchini, S. Leonardi (eds.) (2019). (Vol. 132) 23:1–23:14.
    • Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika; Jain, Kshitij; Kindermann, Philipp; Lubiw, Anna in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (ed.) (2019).
    • Stick Graphs with Length Constraints Chaplick, Steven; Kindermann, Philipp; L\"{o}ffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 3–17.
    • Crossing Numbers of Beyond-Planar Graphs Chimani, Markus; Kindermann, Philipp; Montecchiani, Fabrizio; Valtr, Pavel in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 78–86.
    • Drawing Planar Graphs with Few Segments on a Polynomial Grid Kindermann, Philipp; Mchedlidze, Tamara; Schneck, Thomas; Symvonis, Antonios in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 416–429.
    • Computing Height-Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 203–215.
    • Graph Drawing Contest Report Kindermann, Philipp; Mchedlidze, Tamara; Rutter, Ignaz in Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. T\’{o}th (eds.) (2019). (Vol. 11904) 575–583.
    • Computing Optimal Tangles Faster Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proceedings of the 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (ed.) (2019).
    • Graph Drawing Contest Report Devanny, William; Kindermann, Philipp; L{\"{o}}ffler, Maarten; Rutter, Ignaz in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 609–617.
    • Integral Unit Bar-Visibility Graphs Biedl, Therese; Biniaz, Ahmad; Irvine, Veronika; Kindermann, Philipp; Naredla, Anurag Murty; Turcotte, Alexi in Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG’18), S. Durocher, S. Kamali (eds.) (2018). 230–246.
    • Greedy Rectilinear Drawings Angelini, Patrizio; Bekos, Michael; Didimo, Walter; Grilli, Luca; Kindermann, Philipp; Mchedlidze, Tamara; Prutkin, Roman; Symvonis, Antonios; Tappini, Alessandra in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 495–508.
    • Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena; Schulz, André in Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.) (2018). (Vol. 11282) 152–166.
    • The Partition Spanning Forest Problem Kindermann, Philipp; Klemz, Boris; Rutter, Ignaz; Schnider, Patrick; Schulz, Andr{\’e} in Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), W. Mulzer (ed.) (2018). 53:1–53:6.
    • Placing your Coins on a Shelf Alt, Helmut; Buchin, Kevin; Chaplick, Steven; Cheong, Otfried; Kindermann, Philipp; Knauer, Christian; Stehn, Fabian in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC’17), Y. Okamoto, T. Tokuyama (eds.) (2017). (Vol. 92) 4:1–4:12.
    • Drawing Planar Graphs with Few Geometric Primitives H{\"u}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{\’e} in Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’17), Lecture Notes in Computer Science, H. L. Bodlaender, G. J. Woeginger (eds.) (2017). (Vol. 10520) 316–329.
    • 1-Fan-Bundle-Planar Drawings of Graphs Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 517–530.
    • Lombardi Drawings of Knots and Links Kindermann, Philipp; Kobourov, Stephen; L{\"o}ffler, Maarten; N{\"o}llenburg, Martin; Schulz, Andr{\’e}; Vogtenhuber, Birgit in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 113–126.
    • Experimental analysis of the accessibility of drawings with few segments Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{\’e} in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 52–64.
    • Graph Drawing Contest Report Devanny, William; Kindermann, Philipp; L{\"{o}}ffler, Maarten; Rutter, Ignaz in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.) (2017). (Vol. 10692) 575–582.
    • Drawing Trees and Triangulations with Few Geometric Primitives H{\"u}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{\’e} in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), G. Barequet, E. Papadopoulou (eds.) (2016). 55–58.
    • Graph Drawing Contest Report Kindermann, Philipp; L{\"{o}}ffler, Maarten; Nachmanson, Lev; Rutter, Ignaz in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 589–595.
    • On the Planar Split Thickness of Graphs Eppstein, Davin; Kindermann, Philipp; Liotta, Giuseppe; Lubiw, Anna; Maignan, Aude; Mondal, Debajyoti; Vosoughpour, Hamideh; Whitesides, Sue; Wismath, Stephen in Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN’16), Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{\’{a}}vez (eds.) (2016). (Vol. 9644) 403–415.
    • Simultaneous Orthogonal Planarity Angelini, Patrizio; Chaplick, Steven; Cornelse, Sabine; Lozzo, Giordano Da; Battista, Giuseppe Di; Eades, Peter; Kindermann, Philipp; Kratochv{\’i}l, Jan; Lipp, Fabian; Rutter, Ignaz in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 532–545.
    • Strongly Monotone Drawings of Planar Graphs Felsner, Stefan; Igamberdiev, Alexander; Kindermann, Philipp; Klemz, Boris; Mchedlidze, Tamara; Scheucher, Manfred in Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), G. Barequet, E. Papadopoulou (eds.) (2016). 59–62.
    • Windrose Planarity – Embedding Graphs with Direction-Constrained Edges Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Di Donato, Valentino; Kindermann, Philipp; Rote, Günter; Rutter, Ignaz in Proceedings of the 27th Annual {ACM-SIAM} Symposium on Discrete Algorithms (SODA’16), R. Krauthgamer (ed.) (2016). 985–996.
    • Fan-Bundle-Planar Drawings of Graphs Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas in Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Lecture Notes in Computer Science, Y. Hu, M. N{\"o}llenburg (eds.) (2016). (Vol. 9801) 634–636.
    • Strongly Monotone Drawings of Planar Graphs Felsner, Stefan; Igamberdiev, Alexander; Kindermann, Philipp; Klemz, Boris; Mchedlidze, Tamara; Scheucher, Manfred in Proceedings of the 32nd International Symposium on Computational Geometry (SoCG’16), LIPIcs, S. Fekete, A. Lubiw (eds.) (2016). (Vol. 51) 37:1–37:15.
    • Graph Drawing Contest Report Kindermann, Philipp; L{\"{o}}ffler, Maarten; Nachmanson, Lev; Rutter, Ignaz in Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD’15), Lecture Notes in Computer Science, E. D. Giacomo, A. Lubiw (eds.) (2015). (Vol. 9411) 531–537.
    • Solving Optimization Problems on Orthogonal Ray Graphs Chaplick, Steven; Kindermann, Philipp; Lipp, Fabian; Wolff, Alexander in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15) (2015). 2 pp.
    • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander in Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM’15), Lecture Notes in Computer Science, M. Rahman, E. Tomita (eds.) (2015). (Vol. 8973) 222–233.
    • Colored Non-Crossing Euclidean Steiner Forest Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15), Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.) (2015). (Vol. 9472) 429–441.
    • Minimum Rectilinear Polygons for Given Angle Sequences Evans, William S.; Fleszar, Krzysztof; Kindermann, Philipp; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander in Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG’15), Lecture Notes in Computer Science (2015). (Vol. 9943) 105–119.
    • Recognizing and Drawing IC-Planar Graphs Brandenburg, Franz J.; Didimo, Walter; Evans, William S.; Kindermann, Philipp; Liotta, Giuseppe; Montecchiani, Fabrizio in Proceedings of the 23rd International Symposium on Graph Drawing & Network Visualization (GD’15), Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.) (2015). (Vol. 9411) 295–308.
    • On Monotone Drawings of Trees Kindermann, Philipp; Schulz, André; Spoerhase, Joachim; Wolff, Alexander in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 488–500.
    • Luatodonotes: Boundary Labeling for Annotations in Texts Kindermann, Philipp; Lipp, Fabian; Wolff, Alexander in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 76–88.
    • Improved Approximation Algorithms for Box Contact Representations Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proceedings of the 22nd European Symposium on Algorithms (ESA’14), Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (eds.) (2014). (Vol. 8737) 87–99.
    • Smooth Orthogonal Drawings of Planar Graphs Alam, Md. Jawaherul; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Kobourov, Stephen G.; Wolff, Alexander in Proc. 11th Latin American Sympos. on Theoretical Informatics (LATIN’14), Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.) (2014). (Vol. 8392) 144–155.
    • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander in Proceedings of the 22nd International Symposium on Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.) (2014). (Vol. 8871) 515–516.
    • Two-Sided Boundary Labeling with Adjacent Sides Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{\’e}; Wolff, Alexander in Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13), Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (eds.) (2013). (Vol. 8037) 463–474.
    • Two-Sided Boundary Labeling with Adjacent Sides Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{\’e}; Wolff, Alexander in Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13), S. Fekete (ed.) (2013). 233–236.
    Mastersthesis[ to top ]
    • Vehicle Routing with Time Constraints and Different Vehicles Kindermann, Philipp PhD thesis, Lehrstuhl f\"ur Informatik I, Universit\"at W\"urzburg. (2011, October).
    PhD thesis[ to top ]
    • Angular Schematization in Graph Drawing Kindermann, Philipp PhD thesis, Fakultät für Mathematik und Informatik, Universität Würzburg. (2015, June).