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[ to top ]
  • Recognizing Stick Graphs with and without Length Constraints. Chaplick, Steven; Kindermann, Philipp; L{{ö}}ffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes. In Journal of Graph Algorithms and Applications, 24(4), pp. 657–681. 2020.
  • 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, 25(1), pp. 1–28. 2020.
  • Lombardi Drawings of Knots and Links. Kindermann, Philipp; Kobourov, Stephen; L{ö}ffler, Maarten; N{ö}llenburg, Martin; Schulz, Andr{é}; Vogtenhuber, Birgit. In Journal of Computational Geometry, 10(1), pp. 444–476. 2019.
  • 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, 795, pp. 375–397. 2019.
  • Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. Angelini, Patrizio; Lozzo, Giordano Da; Battista, Giuseppe Di; Donato, Valentino Di; Kindermann, Philipp; Rote, G{{ü}}nter; Rutter, Ignaz. In Transactions on Algorithms, 14(4), pp. 54:1–54:24. 2018.
  • Experimental analysis of the accessibility of drawings with few segments. Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{é}. In Journal of Graph Algorithms and Applications, 22(3), pp. 501–518. 2018.
  • Drawing Planar Graphs with Few Geometric Primitives. H{ü}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{é}. In Journal of Graph Algorithms and Applications, 22(2), pp. 357–387. 2018.
  • 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, 9(1), pp. 312–327. 2018.
  • 1-Fan-Bundle-Planar Drawings of Graphs. Angelini, Patrizio; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Schneck, Thomas. In Theoretical Computer Science, 723, pp. 23–50. 2018.
  • 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, 80(3), pp. 977–994. 2018.
  • 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, 77(3), pp. 902–920. 2017.
  • Recognizing and Drawing IC-Planar Graphs. Brandenburg, Franz J.; Didimo, Walter; Evans, William S.; Kindermann, Philipp; Liotta, Giuseppe; Montecchiani, Fabrizio. In Theoretical Computer Science, 636, pp. 1–16. 2016.
  • 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, 20(1), pp. 133–158. 2016.
  • Multi-Sided Boundary Labeling. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{é}; Wolff, Alexander. In Algorithmica, 76(1), pp. 225–258. 2016.
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.
  • 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.), pp. 67:1–67:8. Würzburg, 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.
  • 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.), pp. 70:1–70:6. Würzburg, 2020.
  • 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.
  • 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.). Utrecht, 2019.
  • 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.). Seoul, 2019.
  • 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), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 203–215. Springer-Verlag, 2019.
  • 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), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 575–583. Springer-Verlag, 2019.
  • Finding Tutte Paths in Linear Time. Biedl, Therese; Kindermann, Philipp. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP’19), Vol. 132 of LIPIcs, C. Baier, I. Chatzigiannakis, P. Flocchini, S. Leonardi (eds.), pp. 23:1–23:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 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 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (ed.). Utrecht, 2019.
  • Stick Graphs with Length Constraints. Chaplick, Steven; Kindermann, Philipp; L{ö}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), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 3–17. Springer-Verlag, 2019.
  • 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), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 416–429. Springer-Verlag, 2019.
  • 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), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. T{ó}th (eds.), pp. 78–86. Springer-Verlag, 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), Vol. 11789 of Lecture Notes in Computer Science, I. Sau, D. M. Thilikos (eds.), pp. 258–270. Springer-Verlag, 2019.
  • The Partition Spanning Forest Problem. Kindermann, Philipp; Klemz, Boris; Rutter, Ignaz; Schnider, Patrick; Schulz, Andr{é}. In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG’18), W. Mulzer (ed.), pp. 53:1–53:6. FU Berlin, 2018.
  • 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.), pp. 230–246. University of Manitoba, 2018.
  • Graph Drawing Contest Report. Devanny, William; Kindermann, Philipp; L{{ö}}ffler, Maarten; Rutter, Ignaz. In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD’18), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 609–617. Springer-Verlag, 2018.
  • 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), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 495–508. Springer-Verlag, 2018.
  • 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), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 152–166. Springer-Verlag, 2018.
  • 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), Vol. 92, Y. Okamoto, T. Tokuyama (eds.), pp. 4:1–4:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
  • Drawing Planar Graphs with Few Geometric Primitives. H{ü}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{é}. In Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’17), Vol. 10520 of Lecture Notes in Computer Science, H. L. Bodlaender, G. J. Woeginger (eds.), pp. 316–329. Springer-Verlag, 2017.
  • Graph Drawing Contest Report. Devanny, William; Kindermann, Philipp; L{{ö}}ffler, Maarten; Rutter, Ignaz. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 575–582. Springer-Verlag, 2017.
  • Lombardi Drawings of Knots and Links. Kindermann, Philipp; Kobourov, Stephen; L{ö}ffler, Maarten; N{ö}llenburg, Martin; Schulz, Andr{é}; Vogtenhuber, Birgit. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 113–126. Springer, 2017.
  • Experimental analysis of the accessibility of drawings with few segments. Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{é}. In Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 52–64. Springer-Verlag, 2017.
  • 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), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 517–530. Springer-Verlag, 2017.
  • 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), Vol. 9644 of Lecture Notes in Computer Science, E. Kranakis, G. Navarro, E. Ch{{á}}vez (eds.), pp. 403–415. Springer-Verlag, 2016.
  • 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.), pp. 59–62. Lugano, 2016.
  • Drawing Trees and Triangulations with Few Geometric Primitives. H{ü}ltenschmidt, Gregor; Kindermann, Philipp; Meulemans, Wouter; Schulz, Andr{é}. In Proceedings of the 32nd European Workshop on Computational Geometry (EuroCG’16), G. Barequet, E. Papadopoulou (eds.), pp. 55–58. Lugano, 2016.
  • 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), Vol. 51 of LIPIcs, S. Fekete, A. Lubiw (eds.), pp. 37:1–37:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.
  • 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), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. N{ö}llenburg (eds.), pp. 634–636. Springer-Verlag, 2016.
  • Simultaneous Orthogonal Planarity. Angelini, Patrizio; Chaplick, Steven; Cornelse, Sabine; Lozzo, Giordano Da; Battista, Giuseppe Di; Eades, Peter; Kindermann, Philipp; Kratochv{í}l, Jan; Lipp, Fabian; Rutter, Ignaz. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. N{ö}llenburg (eds.), pp. 532–545. Springer-Verlag, 2016.
  • 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.), pp. 985–996. SIAM, 2016.
  • Graph Drawing Contest Report. Kindermann, Philipp; L{{ö}}ffler, Maarten; Nachmanson, Lev; Rutter, Ignaz. In Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. N{ö}llenburg (eds.), pp. 589–595. Springer-Verlag, 2016.
  • 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), Vol. 9472 of Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.), pp. 429–441. Springer-Verlag, 2015.
  • 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), Vol. 8973 of Lecture Notes in Computer Science, M. Rahman, E. Tomita (eds.), pp. 222–233. Springer-Verlag, 2015.
  • 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), Vol. 9411 of Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.), pp. 295–308. Springer-Verlag, 2015.
  • 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), p. 2 pp. 2015.
  • Graph Drawing Contest Report. Kindermann, Philipp; L{{ö}}ffler, Maarten; Nachmanson, Lev; Rutter, Ignaz. In Proceedings of the 23rd International Symposium on Graph Drawing and Network Visualization (GD’15), Vol. 9411 of Lecture Notes in Computer Science, E. D. Giacomo, A. Lubiw (eds.), pp. 531–537. Springer, 2015.
  • 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), Vol. 9943 of Lecture Notes in Computer Science, pp. 105–119. Springer-Verlag, 2015.
  • 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), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 515–516. Springer-Verlag, 2014.
  • 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), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 76–88. Springer-Verlag, 2014.
  • 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), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 488–500. Springer-Verlag, 2014.
  • 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), Vol. 8392 of Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.), pp. 144–155. Springer-Verlag, 2014.
  • 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), Vol. 8737 of Lecture Notes in Computer Science, A. S. Schulz, D. Wagner (eds.), pp. 87–99. Springer-Verlag, 2014.
  • Two-Sided Boundary Labeling with Adjacent Sides. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{é}; Wolff, Alexander. In Proceedings of the 29th European Workshop on Computational Geometry (EuroCG’13), S. Fekete (ed.), pp. 233–236. Braunschweig, 2013.
  • Two-Sided Boundary Labeling with Adjacent Sides. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, Andr{é}; Wolff, Alexander. In Proceedings of the 13th International Algorithms and Data Structure Symposium (WADS’13), Vol. 8037 of Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (eds.), pp. 463–474. Springer-Verlag, 2013.
Mastersthesis[ to top ]
  • Vehicle Routing with Time Constraints and Different Vehicles. Technical Report (Master thesis), . Kindermann, Philipp. Master thesis. Lehrstuhl für Informatik I, Universität Würzburg, 2011, October.
PhD thesis[ to top ]
  • Angular Schematization in Graph Drawing. Technical Report (PhD dissertation), . Kindermann, Philipp. PhD dissertation. Fakultät für Mathematik und Informatik, Universität Würzburg, 2015, June.