Philipp Kindermann

From MaRDI portal
(Redirected from Person:290511)


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
On layered area-proportional rectangle contact representations
Theoretical Computer Science
2025-01-08Paper
Upward and orthogonal planarity are W[1-hard parameterized by treewidth]
 
2024-10-14Paper
On layered area-proportional rectangle contact representations
 
2024-07-19Paper
Mutual witness proximity drawings of isomorphic trees
 
2024-06-21Paper
Three edge-disjoint plane spanning paths in a point set
 
2024-06-21Paper
Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
 
2024-05-31Paper
Perfect matchings with crossings
Algorithmica
2024-03-25Paper
The Computational Complexity of the ChordLink Model
Journal of Graph Algorithms and Applications
2023-12-20Paper
Recognizing well-dominated graphs is coNP-complete
Information Processing Letters
2023-10-12Paper
The Rique-number of graphs
Lecture Notes in Computer Science
2023-08-16Paper
Morphing rectangular duals
Lecture Notes in Computer Science
2023-08-16Paper
Outside-obstacle representations with all vertices on the outer face
Lecture Notes in Computer Science
2023-08-16Paper
Graph drawing contest report
Lecture Notes in Computer Science
2023-08-16Paper
Parameterized approaches to orthogonal compaction
Lecture Notes in Computer Science
2023-08-14Paper
The complexity of finding tangles
Lecture Notes in Computer Science
2023-08-14Paper
Extending partial representations of rectangular duals with given contact orientations
 
2023-03-22Paper
On mixed linear layouts of series-parallel graphs
Theoretical Computer Science
2022-10-21Paper
Perfect matchings with crossings
 
2022-08-30Paper
scientific article; zbMATH DE number 7561516 (Why is no real title available?)
 
2022-07-21Paper
One-bend drawings of outerplanar graphs inside simple polygons
 
2022-07-01Paper
Graph drawing contest report
Lecture Notes in Computer Science
2022-07-01Paper
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Theoretical Computer Science
2022-05-10Paper
Minimum rectilinear polygons for given angle sequences
Computational Geometry
2021-12-15Paper
Crossing numbers of beyond-planar graphs
Theoretical Computer Science
2021-12-01Paper
On Mixed Linear Layouts of Series-Parallel Graphs
Lecture Notes in Computer Science
2021-12-01Paper
Graph Drawing Contest Report
Lecture Notes in Computer Science
2021-12-01Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
Journal of Graph Algorithms and Applications
2021-01-19Paper
Recognizing stick graphs with and without length constraints
Journal of Graph Algorithms and Applications
2020-12-18Paper
Placing your coins on a shelf
 
2020-11-25Paper
Drawing planar graphs with few segments on a polynomial grid
 
2020-10-26Paper
Crossing numbers of beyond-planar graphs
Lecture Notes in Computer Science
2020-10-26Paper
Stick graphs with length constraints
 
2020-10-26Paper
Computing height-optimal tangles faster
 
2020-10-26Paper
Graph drawing contest report
Lecture Notes in Computer Science
2020-10-26Paper
Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs
 
2020-02-24Paper
Lombardi drawings of knots and links
 
2020-01-13Paper
Greedy rectilinear drawings
Theoretical Computer Science
2019-10-18Paper
Windrose planarity: embedding graphs with direction-constrained edges
ACM Transactions on Algorithms
2019-03-28Paper
Placing your coins on a shelf
 
2019-02-27Paper
Experimental analysis of the accessibility of drawings with few segments
Lecture Notes in Computer Science
2019-02-20Paper
Lombardi drawings of knots and links
Lecture Notes in Computer Science
2019-02-20Paper
1-fan-bundle-planar drawings of graphs
Lecture Notes in Computer Science
2019-02-20Paper
Greedy rectilinear drawings
Lecture Notes in Computer Science
2019-02-15Paper
Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
 
2019-02-15Paper
Finding Tutte paths in linear time
 
2018-12-11Paper
Experimental analysis of the accessibility of drawings with few segments
Journal of Graph Algorithms and Applications
2018-10-25Paper
Drawing planar graphs with few geometric primitives
Journal of Graph Algorithms and Applications
2018-09-06Paper
Windrose planarity: embedding graphs with direction-constrained edges
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
On the planar split thickness of graphs
Algorithmica
2018-04-11Paper
1-fan-bundle-planar drawings of graphs
Theoretical Computer Science
2018-04-04Paper
Strongly monotone drawings of planar graphs
 
2018-01-30Paper
Drawing planar graphs with few geometric primitives
 
2018-01-04Paper
On Gallai's conjecture for series-parallel graphs and planar 3-trees
 
2017-06-13Paper
Improved approximation algorithms for box contact representations
Algorithmica
2017-04-12Paper
Simultaneous orthogonal planarity
Lecture Notes in Computer Science
2017-02-21Paper
Recognizing and drawing IC-planar graphs
Lecture Notes in Computer Science
2017-02-10Paper
Minimum rectilinear polygons for given angle sequences
Lecture Notes in Computer Science
2017-02-01Paper
Multi-sided boundary labeling
Algorithmica
2016-11-01Paper
Recognizing and drawing IC-planar graphs
Theoretical Computer Science
2016-06-01Paper
On the planar split thickness of graphs
Lecture Notes in Computer Science
2016-05-03Paper
Simultaneous drawing of planar graphs with right-angle crossings and few bends
Journal of Graph Algorithms and Applications
2016-03-03Paper
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation
2016-01-11Paper
Simultaneous drawing of planar graphs with right-angle crossings and few bends
WALCOM: Algorithms and Computation
2015-02-27Paper
On monotone drawings of trees
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
2015-01-07Paper
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014
2014-10-08Paper
Smooth Orthogonal Drawings of Planar Graphs
LATIN 2014: Theoretical Informatics
2014-03-31Paper
Two-sided boundary labeling with adjacent sides
Lecture Notes in Computer Science
2013-08-12Paper


Research outcomes over time


This page was built for person: Philipp Kindermann