Philipp Kindermann

Orcid: 0000-0001-5764-7719

Affiliations:

Universität Trier, Germany
Universität Würzburg, Germany
FernUniversität in Hagen, Germany

According to our database¹, Philipp Kindermann authored at least 64 papers between 2013 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

On layered area-proportional rectangle contact representations.

[BibT_eX]

[DOI]

Carolina Haase

Philipp Kindermann

Theor. Comput. Sci., 2025

2024

Perfect Matchings with Crossings.

[BibT_eX]

[DOI]

Algorithmica, March, 2024

Recognizing well-dominated graphs is coNP-complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., January, 2024

Geometric Thickness of Multigraphs is ∃ ℝ-Complete.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization.

[BibT_eX]

[DOI]

Philipp Kindermann

Fabian Klute

Soeren Terziadis

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

On k-Plane Insertion into Plane Drawings.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

Weakly Leveled Planarity with Bounded Span.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Giordano Da Lozzo

Philipp Kindermann

J. Graph Algorithms Appl., 2023

The Computational Complexity of the ChordLink Model.

[BibT_eX]

[DOI]

Philipp Kindermann

Jan Sauer

Alexander Wolff

J. Graph Algorithms Appl., 2023

Deciding the Feasibility and Minimizing the Height of Tangles.

[BibT_eX]

[DOI]

CoRR, 2023

Splitting Vertices in 2-Layer Graph Drawings.

[BibT_eX]

[DOI]

IEEE Computer Graphics and Applications, 2023

The Complexity of Finding Tangles.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Parameterized Approaches to Orthogonal Compaction.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Liana Khazaliya

Philipp Kindermann

Giuseppe Liotta

Fabrizio Montecchiani

Kirill Simonov

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Three Edge-Disjoint Plane Spanning Paths in a Point Set.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Kirill Simonov

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Mutual Witness Proximity Drawings of Isomorphic Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Crossing numbers of beyond-planar graphs.

[BibT_eX]

[DOI]

Markus Chimani

Philipp Kindermann

Fabrizio Montecchiani

Pavel Valtr

Theor. Comput. Sci., 2022

Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On mixed linear layouts of series-parallel graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Minimum rectilinear polygons for given angle sequences.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Outside-Obstacle Representations with All Vertices on the Outer Face.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Morphing Rectangular Duals.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

The Rique-Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021

Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.

[BibT_eX]

[DOI]

Philipp Kindermann

Fabrizio Montecchiani

Lena Schlipf

André Schulz

J. Graph Algorithms Appl., 2021

ClusterSets: Optimizing Planar Clusters in Categorical Point Data.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2021

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Philipp Kindermann

Tamara Mchedlidze

Wouter Meulemans

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Extending Partial Representations of Rectangular Duals with Given Contact Orientations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Recognizing Stick Graphs with and without Length Constraints.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Greedy rectilinear drawings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Lombardi drawings of knots and links.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Maximum Matchings and Minimum Blocking Sets in Θ<sub>6</sub>-Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Finding Tutte Paths in Linear Time.

[BibT_eX]

[DOI]

Therese Biedl

Philipp Kindermann

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Drawing Planar Graphs with Few Segments on a Polynomial Grid.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Philipp Kindermann

Tamara Mchedlidze

Ignaz Rutter

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Computing Height-Optimal Tangles Faster.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Stick Graphs with Length Constraints.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

1-Fan-bundle-planar drawings of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Placing your coins on a shelf.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Experimental Analysis of the Accessibility of Drawings with Few Segments.

[BibT_eX]

[DOI]

Philipp Kindermann

Wouter Meulemans

André Schulz

J. Graph Algorithms Appl., 2018

Drawing Planar Graphs with Few Geometric Primitives.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2018

The Partition Spanning Forest Problem.

[BibT_eX]

[DOI]

CoRR, 2018

On the Planar Split Thickness of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Integral Unit Bar-Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

On Gallai's conjecture for series-parallel graphs and planar 3-trees.

[BibT_eX]

[DOI]

Philipp Kindermann

Lena Schlipf

André Schulz

CoRR, 2017

Improved Approximation Algorithms for Box Contact Representations.

[BibT_eX]

[DOI]

Algorithmica, 2017

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Recognizing and drawing IC-planar graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Theor. Comput. Sci., 2016

Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Multi-sided Boundary Labeling.

[BibT_eX]

[DOI]

Algorithmica, 2016

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Simultaneous Orthogonal Planarity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Strongly Monotone Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Stefan Felsner

Alexander Igamberdiev

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Angular Schematization in Graph Drawing.

[BibT_eX]

[DOI]

Philipp Kindermann

PhD thesis, 2015

Colored Non-crossing Euclidean Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Smooth Orthogonal Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

On Monotone Drawings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

Luatodonotes: Boundary Labeling for Annotations in Texts.

[BibT_eX]

[DOI]

Philipp Kindermann

Fabian Lipp

Alexander Wolff

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

Two-Sided Boundary Labeling with Adjacent Sides.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Philipp Kindermann

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...