Journal articles

2024

  1. Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S Souza, Recognizing well-dominated graphs is coNP-complete
    Information Processing Letters, vol. 183. [link]

2023

  1. Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber, Perfect Matchings with Crossings
    Algorithmica. [link] (Special Issue on Selected Papers of ISAAC 2022) 
  2. Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger, Splitting Vertices in 2-Layer Graph Drawings
    IEEE Computer Graphics and Applications, vol. 43, no. 3, pp. 24–35. [link]

2022

  1. Patrizio Angelini, Michael Bekos, Philipp Kindermann, Tamara Mchedlidze, On Mixed Linear Layouts of Series-Parallel Graphs
    Theoret. Comput. Sci., vol. 936, pp. 129–138. [link] 
  2. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff, Minimum Rectilinear Polygons for Given Angle Sequences
    Comput. Geom., vol. 100, pp. 101820. [link] 
  3. Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr, Crossing Numbers of Beyond-planar Graphs
    Theoretical Computer Science, vol. 898, pp. 44–49. [link] 
  4. Steven Chaplick, Stefan Felsner, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff, Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
    Theor. Comput. Sci., vol. 919, pp. 66–74. [link] 

2021

  1. Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz, Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
    Journal of Graph Algorithms and Applications, vol. 25, no. 1, pp. 1–28. [link] 
  2. Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff, ClusterSets: Optimizing Planar Clusters in Categorical Point Data
    Computer Graphics Forum, vol. 40, no. 3, pp. 471–481. [link] 

2020

  1. Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink, Recognizing Stick Graphs with and without Length Constraints
    Journal of Graph Algorithms and Applications, vol. 24, no. 4, pp. 657–681. [link]  (Special Issue on Selected Papers of GD 2020) 

2019

  1. Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber, Lombardi Drawings of Knots and Links
    Journal of Computational Geometry, vol. 10, no. 1, pp. 444–476. [link] 
  2. Patrizio Angelini, Michael Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini, Greedy Rectilinear Drawings
    Theoretical Computer Science, vol. 795, pp. 375–397. [link] 

2018

  1. Philipp Kindermann, Wouter Meulemans, André Schulz, Experimental Analysis of the Accessibility of Drawings with Few Segments
    Journal of Graph Algorithms and Applications, vol. 22, no. 3, pp. 501–518. [link]  (Special Issue on Selected Papers of GD 2017) 
  2. David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen Wismath, On the Planar Split Thickness of Graphs
    Algorithmica, vol. 80, no. 3, pp. 977–994. [link]  (Special Issue on Selected Papers of LATIN 2016) 
  3. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck, 1-Fan-Bundle-Planar Drawings of Graphs
    Theoretical Computer Science, vol. 723, pp. 23–50. [link] 
  4. Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz, Drawing Planar Graphs with Few Geometric Primitives
    Journal of Graph Algorithms and Applications, vol. 22, no. 2, pp. 357–387. [link] 
  5. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter, Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
    Transactions on Algorithms, vol. 14, no. 4, pp. 54:1–54:24. [link] 
  6. Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn, Placing your Coins on a Shelf
    Journal of Computational Geometry, vol. 9, no. 1, pp. 312–327. [link] 

2017

  1. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff, Improved Approximation Algorithms for Box Contact Representations
    Algorithmica, vol. 77, no. 3, pp. 902–920. [link] 

2016

  1. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff, Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
    Journal of Graph Algorithms and Applications, vol. 20, no. 1, pp. 133–158. [link]  (Special Issue on Selected Papers of WALCOM 2015) 
  2. Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Recognizing and Drawing IC-Planar Graphs
    Theoretical Computer Science, vol. 636, pp. 1–16. [link] 
  3. Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz and Alexander Wolff, Multi-Sided Boundary Labeling
    Algorithmica, vol. 76, no. 1, pp. 225–258. [link] 

Conference papers

2023

  1. Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov, The st-Planar Edge Completion Problem is Fixed-Parameter Tractable
    Proc. 34th International Symposium on Algorithms and Computation (ISAAC'23)
  2. Carolina Haase, Philipp Kindermann, On Layered Area-Proportional Rectangle Contact Representations
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear. (Poster)
  3. Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans, Debjyoti Mondal, Graph Drawing Contest Report
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear.
  4. Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov, Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear.
  5. Philipp Kindermann, Jan Kratochvil, Giuseppe Liotta, Pavel Valtr, Three Edge-disjoint Plane Spanning Paths in a Point Set
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear.
  6. Carolina Haase, Philipp Kindermann, Giuseppe Liotta, William J. Lenhart, Mutual Witness Proximity Drawings of Isomorphic Trees
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear.
  7. Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink, The Complexity of Finding Tangles
    Proc. 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'23), vol. 13878, pp. 3–17. [link] 
  8. Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi, Parameterized Approaches to Orthogonal Compaction
    Proc. 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'23), vol. 13878, pp. 111–125. [link] 

2022

  1. Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans, Graph Drawing Contest Report
    Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD'22), vol. 13764, pp. 459–470. [link] 
  2. Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen Kobourov, Jan Kratochv\'il, Ignaz Rutter, The Rique-Number of Graphs
    Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD'22), vol. 13764, pp. 371–386. [link] 
  3. Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber, Perfect Matchings with Crossings
    Proc. 33rd International Workshop on Combinatorial Algorithms (IWOCA'22), vol. 13270, pp. 46–59. [link] 
  4. Steve Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff, Morphing Rectangular Duals
    Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD'22), vol. 13764, pp. 389–403. [link] 
  5. Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff, Outside-Obstacle Representationswith All Vertices on the Outer Face
    Proc. 30th International Symposium on Graph Drawing and Network Visualization (GD'22), vol. 13764, pp. 432–440. [link] 

2021

  1. Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 29th International Symposium on Graph Drawing and Network Visualization (GD'21), vol. 12868, pp. 409–417. [link] 
  2. Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff, Extending Partial Representations of Rectangular Duals with Given Contact Orientations
    Proc. 12th International Conference on Algorithms and Complexity (CIAC 2021), vol. 12701, pp. 340–353. [link] 
  3. Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff, ClusterSets: Optimizing Planar Clusters in Categorical Point Data
    Proc. 23rd Eurographics Conf. Vis. (EuroVis'21), vol. 40, no. 3, pp. 471–481. [link] 
  4. Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis, One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
    Proc. 29th International Symposium on Graph Drawing and Network Visualization (GD'21), vol. 12868, pp. 184–192. [link] 

2020

  1. Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD'20), vol. 12590, pp. 507–519. [link] 
  2. Patrizio Angelini, Michael Bekos, Philipp Kindermann, Tamara Mchedlidze, On Mixed Linear Layouts of Series-Parallel Graphs
    Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD'20), vol. 12590, pp. 151–159. [link] 

2019

  1. Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis, Drawing Planar Graphs with Few Segments on a Polynomial Grid
    Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD'19), vol. 11904, pp. 416–429. [link] 
  2. Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD'19), vol. 11904, pp. 575–583. [link] 
  3. Therese Biedl, Philipp Kindermann, Finding Tutte Paths in Linear Time, Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP'19)
    vol. 132, pp. 23:1–23:14. [link] 
  4. Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw, Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs
    Proc. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'19), vol. 11789, pp. 258–270. [link] 
  5. Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr, Crossing Numbers of Beyond-Planar Graphs
    Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD'19), vol. 11904, pp. 78–86. [link] 
  6. Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink, Stick Graphs with Length Constraints
    Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD'19), vol. 11904, pp. 3–17. [link] 
  7. Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink, Computing Height-Optimal Tangles Faster
    Proc. 27th International Symposium on Graph Drawing and Network Visualization (GD'19), vol. 11904, pp. 203–215. [link] 

2018

  1. Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz, Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
    Proc. 26th International Symposium on Graph Drawing and Network Visualization (GD'18), vol. 11282, pp. 152–166. [link] 
  2. Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte, Integral Unit Bar-Visibility Graphs
    Proc. 30th Canadian Conference on Computational Geometry (CCCG'18), pp. 230–246. [link] 
  3. William Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 26th International Symposium on Graph Drawing and Network Visualization (GD'18), vol. 11282, pp. 609–617. [link] 
  4. Patrizio Angelini, Michael Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini, Greedy Rectilinear Drawings
    Proc. 26th International Symposium on Graph Drawing and Network Visualization (GD'18), vol. 11282, pp. 495–508. [link] 

2017

  1. Philipp Kindermann, Wouter Meulemans, André Schulz, Experimental analysis of the accessibility of drawings with few segments
    Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17), vol. 10692, pp. 52–64. [link] 
  2. Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber, Lombardi Drawings of Knots and Links
    Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17), vol. 10692, pp. 113–126. [link] 
  3. Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz, Drawing Planar Graphs with Few Geometric Primitives
    Proc. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'17), vol. 10520, pp. 316–329. [link] 
  4. William Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17), vol. 10692, pp. 575–582. [link] 
  5. Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn, Placing your Coins on a Shelf
    Proc. 28th International Symposium on Algorithms and Computation (ISAAC'17), vol. 92, pp. 4:1–4:12. [link] 
  6. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck, 1-Fan-Bundle-Planar Drawings of Graphs
    Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD'17), vol. 10692, pp. 514–530. [link] 

2016

  1. Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter, Simultaneous Orthogonal Planarity
    Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16), vol. 9801, pp. 532–545. [link] 
  2. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter, Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
    Proc. 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'16), pp. 985–996. [link] 
  3. David Eppstein, Philipp Kindermann, Stephen Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen Wismath, On the Planar Split Thickness of Graphs
    Proc. 12th Latin American Theoretical Informatics Symposium (LATIN'16), vol. 9644, pp. 403–415. [link] 
  4. Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher, Strongly Monotone Drawings of Planar Graphs
    Proc. 32nd International Symposium on Computational Geometry (SoCG'16), vol. 51, pp. 37:1–37:15. [link] 
  5. Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16), vol. 9801, pp. 589–595. [link] 

2015

  1. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff, Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
    Proc. 9th International Workshop on Algorithms and Computation (WALCOM'15), vol. 8973, pp. 222–233. [link] 
  2. Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff, Colored Non-crossing Euclidean Steiner Forest
    Proc. 26th International Symposium on Algorithms and Computation (ISAAC'15), vol. 9472, pp. 429–441. [link] 
  3. Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Recognizing and Drawing IC-Planar Graphs
    Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD'15), vol. 9411, pp. 295–308. [link] 
  4. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff, Minimum Rectilinear Polygons for Given Angle Sequences
    Proc. 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG'15), vol. 9943, pp. 105–119. [link] 
  5. Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter, Graph Drawing Contest Report
    Proc. 23rd International Symposium on Graph Drawing and Network Visualization (GD'15), vol. 9411, pp. 531–537. [link] 

2014

  1. Md. Jawaherul Alam, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Alexander Wolff, Smooth Orthogonal Drawings of Planar Graphs
    Proc. 13th Latin American Symposium on Theorectical Informatics (LATIN'14), vol. 8392, pp. 144–155. [link] 
  2. Michael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff, Improved Approximation Algorithms for Box Contact Representations
    Proc. 22nd Annual European Symposium on Algorithms (ESA'14), vol. 8737, pp. 87–99. [link] 
  3. Philipp Kindermann, Fabian Lipp, Alexander Wolff, Luatodonotes: Boundary Labeling for Annotations in Texts
    Proc. 23rd International Symposium on Graph Drawing (GD'14), vol. 8871, pp. 76–88. [link] 
  4. Philipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff, On Monotone Drawings of Trees
    Proc. 23rd International Symposium on Graph Drawing (GD'14), vol. 8871, pp. 488–500. [link] 

2013

  1. Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff, Two-Sided Boundary Labeling with Adjacent Sides
    Proc. 13th International Symposium on Algorithms and Data Structures (WADS'13), vol. 8037, pp. 463–474. [link] 

Abstracts & Posters

2023

  1. Carolina Haase, Philipp Kindermann, On Layered Area-Proportional Rectangle Contact Representations
    Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), to appear. (Poster)

2022

  1. Philipp Kindermann, Jan Sauer, Alexander Wolff, The Computational Complexity of the ChordLink Model
    Proc. 38th European Workshop on Computational Geometry (EuroCG'22), pp. 10:1–10:7. [link] (Abstract) 
     

2020

  1. Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink, The Complexity of Finding Tangles
    Proc. 28th International Symposium on Graph Drawing and Network Visualization (GD'20), vol. 12590, pp. 539–541. (Poster) 
  2. Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis, One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
    Proc. 36th European Workshop on Computational Geometry (EuroCG'20), pp. 70:1–70:6. [link] (Abstract) 
  3. Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink, The Complexity of Finding Tangles
    Proc. 36th European Workshop on Computational Geometry (EuroCG'20), pp. 67:1–67:8. [link] (Abstract) 

2019

  1. Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw, Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs
    Proc. 35th European Workshop on Computational Geometry (EuroCG'19). [link] (Abstract) 
  2. Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink, Computing Optimal Tangles Faster
    Proc. 35th European Workshop on Computational Geometry (EuroCG'19). [link] (Abstract) 
  3. Oksana Firman, Philipp Kindermann​​​​​​​, Alexander Ravsky, Alexander Wolff, Johannes Zink, Computing Height-Optimal Tangles Faster
    Proc. 12th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC'19). (Abstract) 

2018

  1. Philipp Kindermann​​​​​​​, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz, The Partition Spanning Forest Problem
    Proc. 34th European Workshop on Computational Geometry (EuroCG'18), pp. 53:1–53:6. [link]  (Abstract.) 

2017

  1. Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann​​​​​​​, Christian Knauer, Fabian Stehn, Placing your Coins on a Shelf
    Proc. 20th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC'17), pp. 1–8, 2017. (Abstract) 

2016

  1. Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann,​​​ Boris Klemz, Tamara Mchedlidze, Manfred Scheucher, Strongly Monotone Drawings of Planar Graphs
    Proc. 32nd European Workshop on Computational Geometry (EuroCG'16), pp. 59–62. [link] (Abstract) 
  2. Gregor Hültenschmidt, Philipp Kindermann​​​​​​​, Wouter Meulemans, André Schulz, Drawing Trees and Triangulations with Few Geometric Primitives
    Proc. 32nd European Workshop on Computational Geometry (EuroCG'16), pp. 55–58. [link] (Abstract) 
  3. Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann​​​​​​​, Thomas Schneck, Fan-Bundle-Planar Drawings of Graphs
    Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16), vol. 9801, pp. 634–636. [link] (Poster) 

2015

  1. Steven Chaplick, Fabian Lipp, Philipp Kindermann​​​​​​​, Alexander Wolff, Solving Optimization Problems on Orthogonal Ray Graphs
    Proc. 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG'15). [link] (Abstract) 

2014

  1. Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann​​​​​​​, Alexander Wolff, Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
    Proc. 23rd International Symposium on Graph Drawing (GD'14), vol. 8871, pp. 515–516. [link] (Poster) 

2013

  1. Philipp Kindermann​​​​​​​, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff, Two-Sided Boundary Labeling with Adjacent Sides
    Proc. 29th European Workshop on Computational Geometry (EuroCG'13), pp. 233–236. [link] (Abstract)