Philipp Kindermann

From MaRDI portal
Person:290511

Available identifiers

zbMath Open kindermann.philippDBLP130/4006WikidataQ62053755 ScholiaQ62053755MaRDI QIDQ290511

List of research outcomes





PublicationDate of PublicationType
On layered area-proportional rectangle contact representations2025-01-08Paper
Upward and orthogonal planarity are W[1]-hard parameterized by treewidth2024-10-14Paper
On layered area-proportional rectangle contact representations2024-07-19Paper
Mutual witness proximity drawings of isomorphic trees2024-06-21Paper
Three edge-disjoint plane spanning paths in a point set2024-06-21Paper
Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete2024-05-31Paper
Perfect matchings with crossings2024-03-25Paper
The Computational Complexity of the ChordLink Model2023-12-20Paper
Recognizing well-dominated graphs is coNP-complete2023-10-12Paper
The Rique-number of graphs2023-08-16Paper
Morphing rectangular duals2023-08-16Paper
Outside-obstacle representations with all vertices on the outer face2023-08-16Paper
Graph drawing contest report2023-08-16Paper
Parameterized approaches to orthogonal compaction2023-08-14Paper
The complexity of finding tangles2023-08-14Paper
Extending partial representations of rectangular duals with given contact orientations2023-03-22Paper
On mixed linear layouts of series-parallel graphs2022-10-21Paper
Perfect matchings with crossings2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50911722022-07-21Paper
One-bend drawings of outerplanar graphs inside simple polygons2022-07-01Paper
Graph drawing contest report2022-07-01Paper
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations2022-05-10Paper
Minimum rectilinear polygons for given angle sequences2021-12-15Paper
Crossing numbers of beyond-planar graphs2021-12-01Paper
On Mixed Linear Layouts of Series-Parallel Graphs2021-12-01Paper
Graph Drawing Contest Report2021-12-01Paper
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles2021-01-19Paper
Recognizing Stick Graphs with and without Length Constraints2020-12-18Paper
Placing your Coins on a Shelf2020-11-25Paper
Drawing planar graphs with few segments on a polynomial grid2020-10-26Paper
Crossing numbers of beyond-planar graphs2020-10-26Paper
Stick graphs with length constraints2020-10-26Paper
Computing height-optimal tangles faster2020-10-26Paper
Graph drawing contest report2020-10-26Paper
Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs2020-02-24Paper
https://portal.mardi4nfdi.de/entity/Q52078772020-01-13Paper
Greedy rectilinear drawings2019-10-18Paper
Windrose Planarity2019-03-28Paper
Placing your Coins on a Shelf2019-02-27Paper
1-fan-bundle-planar drawings of graphs2019-02-20Paper
Experimental Analysis of the Accessibility of Drawings with Few Segments2019-02-20Paper
Lombardi Drawings of Knots and Links2019-02-20Paper
Greedy rectilinear drawings2019-02-15Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles2019-02-15Paper
Finding Tutte paths in linear time2018-12-11Paper
Experimental Analysis of the Accessibility of Drawings with Few Segments2018-10-25Paper
Drawing Planar Graphs with Few Geometric Primitives2018-09-06Paper
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges2018-07-16Paper
On the planar split thickness of graphs2018-04-11Paper
1-fan-bundle-planar drawings of graphs2018-04-04Paper
https://portal.mardi4nfdi.de/entity/Q31328712018-01-30Paper
Drawing planar graphs with few geometric primitives2018-01-04Paper
On Gallai's conjecture for series-parallel graphs and planar 3-trees2017-06-13Paper
Improved approximation algorithms for box contact representations2017-04-12Paper
Simultaneous Orthogonal Planarity2017-02-21Paper
Recognizing and drawing IC-planar graphs2017-02-10Paper
Minimum Rectilinear Polygons for Given Angle Sequences2017-02-01Paper
Multi-sided boundary labeling2016-11-01Paper
Recognizing and drawing IC-planar graphs2016-06-01Paper
On the planar split thickness of graphs2016-05-03Paper
Simultaneous drawing of planar graphs with right-angle crossings and few bends2016-03-03Paper
Colored Non-crossing Euclidean Steiner Forest2016-01-11Paper
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends2015-02-27Paper
On Monotone Drawings of Trees2015-01-07Paper
Improved Approximation Algorithms for Box Contact Representations2014-10-08Paper
Smooth Orthogonal Drawings of Planar Graphs2014-03-31Paper
Two-Sided Boundary Labeling with Adjacent Sides2013-08-12Paper

Research outcomes over time

This page was built for person: Philipp Kindermann