| Publication | Date of Publication | Type |
|---|
| Mutual witness proximity drawings of isomorphic trees | 2024-06-21 | Paper |
On the complexity of the storyplan problem
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Mutual witness Gabriel drawings of complete bipartite graphs
Theoretical Computer Science | 2023-09-18 | Paper |
On the complexity of the storyplan problem
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Mutual witness Gabriel drawings of complete bipartite graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Drawing partial 2-trees with few slopes
Algorithmica | 2023-04-28 | Paper |
Packing trees into 1-planar graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
\((k,p)\)-planarity: a relaxation of hybrid planarity
Theoretical Computer Science | 2021-11-18 | Paper |
| 3D snap rounding | 2020-08-18 | Paper |
Packing trees into 1-planar graphs
(available as arXiv preprint) | 2020-07-22 | Paper |
Rounding meshes in 3D
Discrete & Computational Geometry | 2020-06-16 | Paper |
Corrigendum to ``On the edge-length ratio of outerplanar graphs
Theoretical Computer Science | 2020-01-16 | Paper |
Packing Trees into 1-planar Graphs
(available as arXiv preprint) | 2019-11-05 | Paper |
\((k, p)\)-planarity: a relaxation of hybrid planarity
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
On the edge-length ratio of outerplanar graphs
Theoretical Computer Science | 2019-05-02 | Paper |
On the edge-length ratio of outerplanar graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On partitioning the edges of 1-plane graphs
Theoretical Computer Science | 2017-01-09 | Paper |
Bar 1-visibility graphs and their relation to other nearly planar graphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Planar and plane slope number of partial 2-trees
Graph Drawing | 2013-12-20 | Paper |
Point-set embeddability of 2-colored trees
Graph Drawing | 2013-04-03 | Paper |
On representing graphs by touching cuboids
Graph Drawing | 2013-04-03 | Paper |
On point-sets that support planar graphs
Computational Geometry | 2012-10-12 | Paper |
On point-sets that support planar graphs
Graph Drawing | 2012-03-09 | Paper |
On the degree of standard geometric predicates for line transversals in 3D
Computational Geometry | 2009-06-18 | Paper |
Bichromatic \(P_{4}\)-composition schemes for perfect orderability
Discrete Applied Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080112 (Why is no real title available?) | 2004-08-04 | Paper |
The drawability problem for minimum weight triangulations
Theoretical Computer Science | 2002-03-03 | Paper |
| Perfectly orderable \(P_4\) composition | 2001-10-24 | Paper |
Drawing outerplanar minimum weight triangulations
Information Processing Letters | 1997-02-27 | Paper |
Characterizing proximity trees
Algorithmica | 1997-01-14 | Paper |
Reconfiguring closed polygonal chains in Euclidean \(d\)-space
Discrete & Computational Geometry | 1995-03-20 | Paper |
An art gallery theorem for line segments in the plane
Pattern Recognition Letters | 1994-02-17 | Paper |
On the \(P_ 4\)-structure of perfect graphs. IV: Partner graphs
Journal of Combinatorial Theory. Series B | 1992-06-25 | Paper |
Two-colourings that decompose perfect graphs
Journal of Combinatorial Theory. Series B | 1990-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
