Two-Sided Boundary Labeling with Adjacent Sides. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (WADS, 2013)

Luatodonotes: Boundary Labeling for Annotations in Texts. - Philipp Kindermann; Fabian Lipp; Alexander Wolff 001 (GD, 2014)

On Monotone Drawings of Trees. - Philipp Kindermann; André Schulz 001; Joachim Spoerhase; Alexander Wolff 001 (GD, 2014)

Smooth Orthogonal Drawings of Planar Graphs. - Muhammad Jawaherul Alam; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Alexander Wolff 001 (LATIN, 2014)

Colored Non-crossing Euclidean Steiner Forest. - Sergey Bereg; Krzysztof Fleszar 001; Philipp Kindermann; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (ISAAC, 2015)

Angular Schematization in Graph Drawing. - Philipp Kindermann (2015)

Strongly Monotone Drawings of Planar Graphs. - Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher (SoCG, 2016)

Simultaneous Orthogonal Planarity. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Giuseppe Di Battista; Peter Eades; Philipp Kindermann; Jan Kratochvíl; Fabian Lipp; Ignaz Rutter (GD, 2016)

Graph Drawing Contest Report. - Philipp Kindermann; Maarten Löffler; Lev Nachmanson; Ignaz Rutter (GD, 2016)

Multi-sided Boundary Labeling. - Philipp Kindermann; Benjamin Niedermann; Ignaz Rutter; Marcus Schaefer 001; André Schulz 001; Alexander Wolff 001 (Algorithmica, 2016)

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. - Michael A. Bekos; Thomas C. van Dijk; Philipp Kindermann; Alexander Wolff 001 (J. Graph Algorithms Appl., 2016)

Recognizing and drawing IC-planar graphs. - Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2016)

Graph Drawing Contest Report. - William E. Devanny; Philipp Kindermann; Maarten Löffler; Ignaz Rutter (GD, 2017)

Improved Approximation Algorithms for Box Contact Representations. - Michael A. Bekos; Thomas C. van Dijk; Martin Fink 001; Philipp Kindermann; Stephen G. Kobourov; Sergey Pupyrev; Joachim Spoerhase; Alexander Wolff 001 (Algorithmica, 2017)

On Gallai's conjecture for series-parallel graphs and planar 3-trees. - Philipp Kindermann; Lena Schlipf; André Schulz 001 (CoRR, 2017)

Integral Unit Bar-Visibility Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Philipp Kindermann; Anurag Murty Naredla; Alexi Turcotte (CCCG, 2018)

On the Planar Split Thickness of Graphs. - David Eppstein; Philipp Kindermann; Stephen G. Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen K. Wismath (Algorithmica, 2018)

The Partition Spanning Forest Problem. - Philipp Kindermann; Boris Klemz; Ignaz Rutter; Patrick Schnider; André Schulz 001 (CoRR, 2018)

Drawing Planar Graphs with Few Geometric Primitives. - Gregor Hültenschmidt; Philipp Kindermann; Wouter Meulemans; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Experimental Analysis of the Accessibility of Drawings with Few Segments. - Philipp Kindermann; Wouter Meulemans; André Schulz 001 (J. Graph Algorithms Appl., 2018)

Placing your coins on a shelf. - Helmut Alt; Kevin Buchin; Steven Chaplick; Otfried Cheong; Philipp Kindermann; Christian Knauer; Fabian Stehn (J. Comput. Geom., 2018)

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. - Patrizio Angelini; Giordano Da Lozzo; Giuseppe Di Battista; Valentino Di Donato; Philipp Kindermann; Günter Rote; Ignaz Rutter (ACM Trans. Algorithms, 2018)

1-Fan-bundle-planar drawings of graphs. - Patrizio Angelini; Michael A. Bekos; Michael Kaufmann 001; Philipp Kindermann; Thomas Schneck (Theor. Comput. Sci., 2018)

Stick Graphs with Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (GD, 2019)

Computing Height-Optimal Tangles Faster. - Oksana Firman; Philipp Kindermann; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (GD, 2019)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Ignaz Rutter (GD, 2019)

Drawing Planar Graphs with Few Segments on a Polynomial Grid. - Philipp Kindermann; Tamara Mchedlidze; Thomas Schneck; Antonios Symvonis (GD, 2019)

Finding Tutte Paths in Linear Time. - Therese Biedl; Philipp Kindermann (ICALP, 2019)

Maximum Matchings and Minimum Blocking Sets in varTheta _6 -Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (WG, 2019)

Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. - Therese Biedl; Ahmad Biniaz; Veronika Irvine; Kshitij Jain 001; Philipp Kindermann; Anna Lubiw (CoRR, 2019)

Lombardi drawings of knots and links. - Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz 001; Birgit Vogtenhuber (J. Comput. Geom., 2019)

Greedy rectilinear drawings. - Patrizio Angelini; Michael A. Bekos; Walter Didimo; Luca Grilli 001; Philipp Kindermann; Tamara Mchedlidze; Roman Prutkin; Antonios Symvonis; Alessandra Tappini (Theor. Comput. Sci., 2019)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Wouter Meulemans; Ignaz Rutter (GD, 2020)

Recognizing Stick Graphs with and without Length Constraints. - Steven Chaplick; Philipp Kindermann; Andre Löffler; Florian Thiele; Alexander Wolff 001; Alexander Zaft; Johannes Zink 001 (J. Graph Algorithms Appl., 2020)

Extending Partial Representations of Rectangular Duals with Given Contact Orientations. - Steven Chaplick; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (CIAC, 2021)

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. - Patrizio Angelini; Philipp Kindermann; Andre Löffler; Lena Schlipf; Antonios Symvonis (GD, 2021)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Wouter Meulemans (GD, 2021)

ClusterSets: Optimizing Planar Clusters in Categorical Point Data. - Jakob Geiger; Sabine Cornelsen; Jan-Henrik Haunert; Philipp Kindermann; Tamara Mchedlidze; Martin Nöllenburg; Yoshio Okamoto; Alexander Wolff 001 (Comput. Graph. Forum, 2021)

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. - Philipp Kindermann; Fabrizio Montecchiani; Lena Schlipf; André Schulz 001 (J. Graph Algorithms Appl., 2021)

The Rique-Number of Graphs. - Michael A. Bekos; Stefan Felsner; Philipp Kindermann; Stephen G. Kobourov; Jan Kratochvíl; Ignaz Rutter (GD, 2022)

Morphing Rectangular Duals. - Steven Chaplick; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (GD, 2022)

Outside-Obstacle Representations with All Vertices on the Outer Face. - Oksana Firman; Philipp Kindermann; Jonathan Klawitter; Boris Klemz; Felix Klesen; Alexander Wolff 001 (GD, 2022)

Graph Drawing Contest Report. - Philipp Kindermann; Fabian Klute; Tamara Mchedlidze; Wouter Meulemans (GD, 2022)

Minimum rectilinear polygons for given angle sequences. - William S. Evans; Krzysztof Fleszar 001; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2022)

On mixed linear layouts of series-parallel graphs. - Patrizio Angelini; Michael A. Bekos; Philipp Kindermann; Tamara Mchedlidze (Theor. Comput. Sci., 2022)

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations. - Steven Chaplick; Stefan Felsner; Philipp Kindermann; Jonathan Klawitter; Ignaz Rutter; Alexander Wolff 001 (Theor. Comput. Sci., 2022)

Crossing numbers of beyond-planar graphs. - Markus Chimani; Philipp Kindermann; Fabrizio Montecchiani; Pavel Valtr 001 (Theor. Comput. Sci., 2022)

Mutual Witness Proximity Drawings of Isomorphic Trees. - Carolina Haase; Philipp Kindermann; William J. Lenhart; Giuseppe Liotta (GD (1), 2023)

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. - Bart M. P. Jansen; Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (GD (2), 2023)

Three Edge-Disjoint Plane Spanning Paths in a Point Set. - Philipp Kindermann; Jan Kratochvíl; Giuseppe Liotta; Pavel Valtr 001 (GD (1), 2023)

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. - Liana Khazaliya; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani; Kirill Simonov (ISAAC, 2023)

The Complexity of Finding Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (SOFSEM, 2023)

Splitting Vertices in 2-Layer Graph Drawings. - Abu Reyan Ahmed; Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Martin Nöllenburg; Antonios Symvonis; Anaïs Villedieu; Markus Wallinger (IEEE Computer Graphics and Applications, 2023)

Deciding the Feasibility and Minimizing the Height of Tangles. - Oksana Firman; Philipp Kindermann; Boris Klemz; Alexander Ravsky; Alexander Wolff 001; Johannes Zink 001 (CoRR, 2023)

The Computational Complexity of the ChordLink Model. - Philipp Kindermann; Jan Sauer; Alexander Wolff 001 (J. Graph Algorithms Appl., 2023)

Guest Editors' Foreword. - Giordano Da Lozzo; Philipp Kindermann (J. Graph Algorithms Appl., 2023)

Weakly Leveled Planarity with Bounded Span. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Ignaz Rutter; Ioannis G. Tollis (GD, 2024)

On k-Plane Insertion into Plane Drawings. - Julia Katheder; Philipp Kindermann; Fabian Klute; Irene Parada; Ignaz Rutter (GD, 2024)

The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization. - Philipp Kindermann; Fabian Klute; Soeren Terziadis (IPEC, 2024)

Geometric Thickness of Multigraphs is ∃ ℝ-Complete. - Henry Förster; Philipp Kindermann; Tillmann Miltzow; Irene Parada; Soeren Terziadis; Birgit Vogtenhuber (LATIN (1), 2024)

Recognizing well-dominated graphs is coNP-complete. - Akanksha Agrawal 001; Henning Fernau; Philipp Kindermann; Kevin Mann; Uéverton S. Souza (Inf. Process. Lett., 2024)

Perfect Matchings with Crossings. - Oswin Aichholzer; Ruy Fabila Monroy; Philipp Kindermann; Irene Parada; Rosna Paul; Daniel Perz; Patrick Schnider; Birgit Vogtenhuber (Algorithmica, 2024)

On layered area-proportional rectangle contact representations. - Carolina Haase; Philipp Kindermann (Theor. Comput. Sci., 2025)

Saturated Drawings of Geometric Thickness k. - Patricia Bachmann; Anna Brötzner; Miriam Goetze; Philipp Kindermann; Matthias Pfretzschner; Soeren Terziadis (CoRR, 2025)

Rectangular Duals on the Cylinder and the Torus. - Therese Biedl; Philipp Kindermann; Jonathan Klawitter (CoRR, 2025)

Parameterized approaches to orthogonal compaction. - Walter Didimo; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Alexander Wolff 001; Meirav Zehavi (J. Comput. Syst. Sci., 2026)