| Publication | Date of Publication | Type |
|---|
Constrained outer-string representations
Discrete Applied Mathematics | 2026-06-12 | Paper |
The price of upwardness
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| A parameterized algorithm for vertex and edge connectivity of embedded graphs | 2026-05-26 | Paper |
Computing conforming partitions with low stabbing number for rectilinear polygons
Information and Computation | 2026-03-20 | Paper |
Finding maximum matchings in RDV graphs efficiently
CGT. Computing in Geometry and Topology | 2026-03-09 | Paper |
On the d-independence number in 1-planar graphs
Graphs and Combinatorics | 2026-01-29 | Paper |
| On the independence number of 1-planar graphs | 2025-12-02 | Paper |
On computing vertex connectivity of 1-planar graphs
Algorithmica | 2025-11-25 | Paper |
On the complexity of embedding in graph products
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| Morphing planar graph drawings via orthogonal box drawings | 2025-10-07 | Paper |
| The price of upwardness | 2025-10-07 | Paper |
| Constrained outer-string representations | 2025-10-07 | Paper |
| Improved outerplanarity bounds for planar graphs | 2025-05-02 | Paper |
| Computing conforming partitions with low stabbing number for rectilinear polygons | 2025-04-15 | Paper |
Reconfiguration of non-crossing spanning trees
Journal of Computational Geometry | 2024-12-19 | Paper |
Large matchings in maximal 1-planar graphs
Discrete Mathematics | 2024-12-02 | Paper |
| On computing the vertex connectivity of 1-plane graphs | 2024-11-14 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
Journal of Computational Geometry | 2024-10-18 | Paper |
| Dispersion for intervals: a geometric approach | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788589 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Matchings in 1‐planar graphs with large minimum degree
Journal of Graph Theory | 2023-10-04 | Paper |
scientific article; zbMATH DE number 7740872 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Visibility representations of toroidal and Klein-bottle graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
| Large Matchings in Maximal 1-planar graphs | 2023-01-03 | Paper |
Finding large matchings in 1-planar graphs of minimum degree 3
(available as arXiv preprint) | 2022-12-21 | Paper |
| On computing the vertex connectivity of 1-plane graphs | 2022-12-13 | Paper |
On triangulating planar graphs under the four-connectivity constraint
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Optimal orthogonal drawings of triconnected plane graphs
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Drawing Halin-graphs with small height
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
scientific article; zbMATH DE number 7561516 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
(available as arXiv preprint) | 2022-07-01 | Paper |
Drawing outer-1-planar graphs revisited
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
All subgraphs of a wheel are 5-coupled-choosable
(available as arXiv preprint) | 2022-03-22 | Paper |
| Area-efficient static and incremental graph drawings | 2021-12-20 | Paper |
Horton-Strahler number, rooted pathwidth and upward drawings of trees
Information Processing Letters | 2021-12-14 | Paper |
| Computing the vertex connectivity of a locally maximal 1-plane graph in linear time | 2021-12-12 | Paper |
Drawing outer-1-planar graphs revisited
(available as arXiv preprint) | 2021-12-04 | Paper |
Rollercoasters and caterpillars
(available as arXiv preprint) | 2021-07-28 | Paper |
Quasiperiodic bobbin lace patterns
Journal of Mathematics and the Arts | 2021-06-15 | Paper |
| Generalized LR-drawings of trees | 2021-05-14 | Paper |
On orthogonally guarding orthogonal polygons with bounded treewidth
Algorithmica | 2021-03-26 | Paper |
All Subgraphs of a Wheel are 5-Coupled-Choosable
(available as arXiv preprint) | 2021-02-04 | Paper |
Minimum ply covering of points with disks and squares
Computational Geometry | 2021-01-07 | Paper |
A note on 1-planar graphs with minimum degree 7
Discrete Applied Mathematics | 2020-12-29 | Paper |
scientific article; zbMATH DE number 7278018 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Line and plane cover numbers revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
Homotopy height, grid-major height and graph-drawing height
(available as arXiv preprint) | 2020-10-26 | Paper |
| On the size of outer-string representations | 2020-08-25 | Paper |
Crossing number for graphs with bounded pathwidth
Algorithmica | 2020-04-09 | Paper |
Packing boundary-anchored rectangles and squares
Computational Geometry | 2020-03-23 | Paper |
Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs
(available as arXiv preprint) | 2020-02-24 | Paper |
| Partitioning orthogonal histograms into rectangular boxes | 2020-02-12 | Paper |
Order-preserving drawings of trees with approximately optimal height (and small width)
Journal of Graph Algorithms and Applications | 2020-01-22 | Paper |
Segment representations with small resolution
Information Processing Letters | 2019-11-21 | Paper |
| Are highly connected 1-planar graphs Hamiltonian? | 2019-11-05 | Paper |
Rollercoasters: Long Sequences without Short Runs
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| Finding big matchings in planar graphs quickly | 2019-02-20 | Paper |
On upward drawings of trees on a given grid
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Improved bounds for drawing trees on fixed points with L-shaped edges
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Grid-obstacle representations with connections to staircase guarding
Lecture Notes in Computer Science | 2019-02-20 | Paper |
EPG-representations with Small Grid-Size
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation
Algorithmica | 2019-01-11 | Paper |
Finding Tutte paths in linear time
(available as arXiv preprint) | 2018-12-11 | Paper |
Embedding-preserving rectangle visibility representations of nonplanar graphs
Discrete & Computational Geometry | 2018-10-30 | Paper |
| Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) | 2018-09-10 | Paper |
On r-guarding thin orthogonal polygons
(available as arXiv preprint) | 2018-04-19 | Paper |
| On visibility representations of non-planar graphs | 2018-01-30 | Paper |
Non-aligned drawings of planar graphs
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
1-string \(B_2\)-VPG representation of planar graphs
(available as arXiv preprint) | 2017-10-10 | Paper |
A 2-approximation for the height of maximal outerplanar graph drawings
(available as arXiv preprint) | 2017-09-22 | Paper |
Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs
(available as arXiv preprint) | 2017-09-22 | Paper |
Planar Matchings for Weighted Straight Skeletons
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Ideal drawings of rooted trees with approximately optimal width
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
On guarding orthogonal polygons with sliding cameras
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Order-preserving 1-string representations of planar graphs
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
| 1-string B₂-VPG representation of planar graphs | 2017-03-30 | Paper |
Non-aligned drawings of planar graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Small-area orthogonal drawings of 3-connected graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Representing directed trees as straight skeletons
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Triangulating planar graphs while keeping the pathwidth small
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
The (3,1)-ordering for 4-connected planar triangulations
Journal of Graph Algorithms and Applications | 2016-07-05 | Paper |
Relating bends and size in orthogonal graph drawings
Information Processing Letters | 2016-06-09 | Paper |
Planar matchings for weighted straight skeletons
Algorithms and Computation | 2015-09-11 | Paper |
Reprint of: Weighted straight skeletons in the plane
Computational Geometry | 2015-04-27 | Paper |
Weighted straight skeletons in the plane
Computational Geometry | 2015-03-06 | Paper |
Height-preserving transformations of planar graph drawings
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
A simple algorithm for computing positively weighted straight skeletons of monotone polygons
Information Processing Letters | 2014-12-09 | Paper |
On triangulating \(k\)-outerplanar graphs
Discrete Applied Mathematics | 2014-12-05 | Paper |
Morphing orthogonal planar graph drawings
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
The point-set embeddability problem for plane graphs
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On Area-Optimal Planar Graph Drawings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Guarding polyominoes
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Orthogonal cartograms with at most 12 corners per face
Computational Geometry | 2014-01-22 | Paper |
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Graph Drawing | 2013-12-20 | Paper |
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Algorithmica | 2013-11-11 | Paper |
Computing cartograms with optimal complexity
Discrete & Computational Geometry | 2013-11-06 | Paper |
A 4-approximation for the height of drawing 2-connected outer-planar graphs
Approximation and Online Algorithms | 2013-09-13 | Paper |
Smart-grid electricity allocation via strip packing with slicing
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Open rectangle-of-influence drawings of non-triangulated planar graphs
Graph Drawing | 2013-04-03 | Paper |
A note on improving the performance of approximation algorithms for radiation therapy
Information Processing Letters | 2013-03-28 | Paper |
Drawing planar 3-trees with given face areas
Computational Geometry | 2013-01-25 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Discrete Applied Mathematics | 2013-01-18 | Paper |
Proportional Contact Representations of Planar Graphs
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
The art gallery theorem for polyominoes
Discrete & Computational Geometry | 2012-10-15 | Paper |
Drawing planar graphs on points inside a polygon
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Stoker's theorem for orthogonal polyhedra
International Journal of Computational Geometry & Applications | 2012-06-20 | Paper |
Proportional contact representations of planar graphs
Graph Drawing | 2012-03-09 | Paper |
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
Graph Drawing | 2012-03-09 | Paper |
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Algorithms and Computation | 2011-12-16 | Paper |
Orthogonal cartograms with few corners per face
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Faster optimal algorithms for segment minimization with small maximal value
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Reconstructing orthogonal polyhedra from putative vertex sets
Computational Geometry | 2011-08-02 | Paper |
Efficient view point selection for silhouettes of convex polyhedra
Computational Geometry | 2011-08-02 | Paper |
Reconstructing polygons from scanner data
Theoretical Computer Science | 2011-07-27 | Paper |
Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections
International Journal of Computational Geometry & Applications | 2011-05-11 | Paper |
Finding hidden independent sets in interval graphs
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
Discrete & Computational Geometry | 2011-03-10 | Paper |
Sorting with networks of data structures
Discrete Applied Mathematics | 2010-11-05 | Paper |
Reconstructing \(hv\)-convex multi-coloured polyominoes
Theoretical Computer Science | 2010-08-11 | Paper |
| On edge-intersection graphs of k-bend paths in grids | 2010-07-27 | Paper |
Small drawings of series-parallel graphs and other subclasses of planar graphs
Graph Drawing | 2010-04-27 | Paper |
Drawing planar 3-trees with given face-areas
Graph Drawing | 2010-04-27 | Paper |
Optimal dynamic video-on-demand using adaptive broadcasting
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Reconstructing polygons from scanner data
Algorithms and Computation | 2009-12-17 | Paper |
Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Edge-Intersection Graphs of k-Bend Paths in Grids
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Morphing polyhedra with parallel faces: Counterexamples
Computational Geometry | 2009-06-18 | Paper |
On the complexity of crossings in permutations
Discrete Mathematics | 2009-04-09 | Paper |
Drawing \(K_{2,n}\): A lower bound
Information Processing Letters | 2009-03-23 | Paper |
Cauchy’s Theorem and Edge Lengths of Convex Polyhedra
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Partitions of Graphs into Trees
Graph Drawing | 2007-08-28 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Three-dimensional orthogonal graph drawing with optimal volume
Algorithmica | 2006-06-14 | Paper |
Polygons needing many flipturns
Discrete & Computational Geometry | 2006-03-21 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A note on 3D orthogonal graph drawing
Discrete Applied Mathematics | 2005-08-17 | Paper |
When can a net fold to a polyhedron?
Computational Geometry | 2005-08-05 | Paper |
Bounded-degree independent sets in planar graphs
Theory of Computing Systems | 2005-06-14 | Paper |
Balanced vertex-orderings of graphs
Discrete Applied Mathematics | 2005-05-04 | Paper |
Fun-Sort -- or the chaos of unordered binary search
Discrete Applied Mathematics | 2005-02-23 | Paper |
Finding hidden independent sets in interval graphs
Theoretical Computer Science | 2004-10-27 | Paper |
Tight bounds on maximal and maximum matchings
Discrete Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2084321 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084285 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2081000 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080107 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1979518 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1974107 (Why is no real title available?) | 2003-09-03 | Paper |
Palindrome recognition using a multidimensional tape.
Theoretical Computer Science | 2003-08-17 | Paper |
Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1759407 (Why is no real title available?) | 2002-10-13 | Paper |
| scientific article; zbMATH DE number 1759406 (Why is no real title available?) | 2002-10-08 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
| Linear reductions of maximum matching | 2002-04-16 | Paper |
| scientific article; zbMATH DE number 1944412 (Why is no real title available?) | 2002-01-01 | Paper |
The DFS-heuristic for orthogonal graph drawing
Computational Geometry | 2001-09-27 | Paper |
1-bend 3-D orthogonal box-drawings: Two open problems solved
Journal of Graph Algorithms and Applications | 2001-07-10 | Paper |
Efficient algorithms for Petersen's matching theorem
Journal of Algorithms | 2001-04-17 | Paper |
The three-phase method: a unified approach to orthogonal graph drawing
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1522946 (Why is no real title available?) | 2000-10-30 | Paper |
| scientific article; zbMATH DE number 1500691 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1305400 (Why is no real title available?) | 1999-06-17 | Paper |
New Lower Bounds For Orthogonal Drawings
Journal of Graph Algorithms and Applications | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1262793 (Why is no real title available?) | 1999-03-15 | Paper |
On triangulating planar graphs under the four-connectivity constraint
Algorithmica | 1998-10-11 | Paper |
A better heuristic for orthogonal graph drawings
Computational Geometry | 1998-08-19 | Paper |
| scientific article; zbMATH DE number 1161375 (Why is no real title available?) | 1998-06-08 | Paper |
