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