Philipp Kindermann

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 109

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

Theor. Comput. Sci.

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃ ℝ-Complete. LATIN (1) (2024)
Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber
Perfect Matchings with Crossings. Algorithmica 86 (3) (2024)
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, Ignaz Rutter
On k-Plane Insertion into Plane Drawings. CoRR (2024)
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183 (2024)
Carolina Haase, Philipp Kindermann
On Layered Area-Proportional Rectangle Contact Representations. WALCOM (2024)
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. GD (2) (2023)
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. CoRR (2023)
Giordano Da Lozzo, Philipp Kindermann
Guest Editors' Foreword. J. Graph Algorithms Appl. 27 (6) (2023)
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. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable. CoRR (2023)
Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable. ISAAC (2023)
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
Three Edge-disjoint Plane Spanning Paths in a Point Set. CoRR (2023)
Carolina Haase, Philipp Kindermann
On Layered Area-Proportional Rectangle Contact Representations. CoRR (2023)
Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber
Geometric Thickness of Multigraphs is ∃R-complete. CoRR (2023)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. SOFSEM (2023)
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
Mutual Witness Proximity Drawings of Isomorphic Trees. GD (1) (2023)
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
The Complexity of Finding Tangles. SOFSEM (2023)
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 43 (3) (2023)
Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, Johannes Zink
Deciding the Feasibility and Minimizing the Height of Tangles. CoRR (2023)
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr
Three Edge-Disjoint Plane Spanning Paths in a Point Set. GD (1) (2023)
Philipp Kindermann, Jan Sauer, Alexander Wolff
The Computational Complexity of the ChordLink Model. J. Graph Algorithms Appl. 27 (9) (2023)
Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta
Mutual Witness Proximity Drawings of Isomorphic Trees. CoRR (2023)
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
Recognizing well-dominated graphs is coNP-complete. CoRR (2022)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100 (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. GD (2022)
Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
Outside-Obstacle Representations with All Vertices on the Outer Face. GD (2022)
Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
Parameterized Approaches to Orthogonal Compaction. CoRR (2022)
Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans
Graph Drawing Contest Report. GD (2022)
Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff
Outside-Obstacle Representations with All Vertices on the Outer Face. CoRR (2022)
Oswin Aichholzer, Ruy Fabila Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, Birgit Vogtenhuber
Perfect Matchings with Crossings. IWOCA (2022)
Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
The Rique-Number of Graphs. GD (2022)
Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter
The Rique-Number of Graphs. CoRR (2022)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898 (2022)
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. 919 (2022)
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze
On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936 (2022)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CoRR (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. CIAC (2021)
Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans
Graph Drawing Contest Report. Graph Drawing (2021)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. J. Graph Algorithms Appl. 25 (1) (2021)
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. Comput. Graph. Forum 40 (3) (2021)
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR (2021)
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff
Morphing Rectangular Duals. CoRR (2021)
Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. Graph Drawing (2021)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Recognizing Stick Graphs with and without Length Constraints. J. Graph Algorithms Appl. 24 (4) (2020)
Oksana Firman, Stefan Felsner, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
The Complexity of Finding Tangles. CoRR (2020)
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze
On Mixed Linear Layouts of Series-Parallel Graphs. CoRR (2020)
Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze
On Mixed Linear Layouts of Series-Parallel Graphs. Graph Drawing (2020)
Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2020)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi drawings of knots and links. J. Comput. Geom. 10 (1) (2019)
Therese C. Biedl, Philipp Kindermann
Finding Tutte Paths in Linear Time. ICALP (2019)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing Numbers of Beyond-Planar Graphs. CoRR (2019)
Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2019)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Stick Graphs with Length Constraints. Graph Drawing (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG (2019)
Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini
Greedy rectilinear drawings. Theor. Comput. Sci. 795 (2019)
Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink
Stick Graphs with Length Constraints. CoRR (2019)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw
-Graphs. CoRR (2019)
Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
Computing Height-Optimal Tangles Faster. Graph Drawing (2019)
Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis
Drawing Planar Graphs with Few Segments on a Polynomial Grid. Graph Drawing (2019)
Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis
Drawing planar graphs with few segments on a polynomial grid. CoRR (2019)
Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
Computing Optimal Tangles Faster. CoRR (2019)
Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr
Crossing Numbers of Beyond-Planar Graphs. Graph Drawing (2019)
William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2018)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. J. Graph Algorithms Appl. 22 (2) (2018)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
1-Fan-bundle-planar drawings of graphs. Theor. Comput. Sci. 723 (2018)
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. ACM Trans. Algorithms 14 (4) (2018)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your coins on a shelf. J. Comput. Geom. 9 (1) (2018)
Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte
Integral Unit Bar-Visibility Graphs. CCCG (2018)
David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
On the Planar Split Thickness of Graphs. Algorithmica 80 (3) (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. Graph Drawing (2018)
Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini
Greedy Rectilinear Drawings. Graph Drawing (2018)
Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini
Greedy Rectilinear Drawings. CoRR (2018)
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles. CoRR (2018)
Philipp Kindermann, Boris Klemz, Ignaz Rutter, Patrick Schnider, André Schulz
The Partition Spanning Forest Problem. CoRR (2018)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental Analysis of the Accessibility of Drawings with Few Segments. J. Graph Algorithms Appl. 22 (3) (2018)
Therese C. Biedl, Philipp Kindermann
Finding Tutte paths in linear time. CoRR (2018)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi Drawings of Knots and Links. CoRR (2017)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental Analysis of the Accessibility of Drawings with Few Segments. Graph Drawing (2017)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi Drawings of Knots and Links. Graph Drawing (2017)
William E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2017)
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 77 (3) (2017)
Philipp Kindermann, Lena Schlipf, André Schulz
On Gallai's conjecture for series-parallel graphs and planar 3-trees. CoRR (2017)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your Coins on a Shelf. ISAAC (2017)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. WG (2017)
Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn
Placing your Coins on a Shelf. CoRR (2017)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
1-Fan-Bundle-Planar Drawings of Graphs. CoRR (2017)
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz
Drawing Planar Graphs with Few Geometric Primitives. CoRR (2017)
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Philipp Kindermann, Thomas Schneck
1-Fan-Bundle-Planar Drawings of Graphs. Graph Drawing (2017)
Philipp Kindermann, Wouter Meulemans, André Schulz
Experimental analysis of the accessibility of drawings with few segments. CoRR (2017)
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher
Strongly Monotone Drawings of Planar Graphs. SoCG (2016)
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher
Strongly Monotone Drawings of Planar Graphs. CoRR (2016)
Philipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter
Graph Drawing Contest Report. Graph Drawing (2016)
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. Graph Drawing (2016)
David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath
On the Planar Split Thickness of Graphs. LATIN (2016)
Michael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. J. Graph Algorithms Appl. 20 (1) (2016)
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. CoRR (2016)
William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Minimum Rectilinear Polygons for Given Angle Sequences. CoRR (2016)
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. SODA (2016)
Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636 (2016)
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff
Multi-sided Boundary Labeling. Algorithmica 76 (1) (2016)

Philipp Kindermann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Philipp Kindermann