| Publication | Date of Publication | Type |
|---|
Weakly leveled planarity with bounded span
Theoretical Computer Science | 2026-03-30 | Paper |
Rectilinear-upward planarity testing of digraphs
Journal of Computer and System Sciences | 2026-03-12 | Paper |
Three edge-disjoint plane spanning paths in a point set
Discrete Mathematics | 2025-12-16 | Paper |
| On the parameterized complexity of computing \(st\)-orientations with few transitive edges | 2024-12-03 | Paper |
On the parameterized complexity of bend-minimum orthogonal planarity
Algorithmica | 2024-10-24 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
Journal of Computational Geometry | 2024-10-18 | Paper |
| On the parameterized complexity of bend-minimum orthogonal planarity | 2024-10-14 | Paper |
| Upward and orthogonal planarity are W[1-hard parameterized by treewidth] | 2024-10-14 | Paper |
Min-\(k\)-planar drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
Algorithmica | 2024-08-13 | Paper |
| Min-\(k\)-planar drawings of graphs | 2024-06-21 | 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 |
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
Rectilinear Planarity of Partial 2-Trees
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
k-Planar Placement and Packing of Δ-Regular Caterpillars
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
On the complexity of the storyplan problem
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
Algorithmica | 2023-09-27 | 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 |
Rectilinear planarity of partial 2-trees
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Parameterized approaches to orthogonal compaction
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Parameterized complexity of graph planarity with restricted cyclic orders
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Drawing partial 2-trees with few slopes
Algorithmica | 2023-04-28 | Paper |
Parameterized complexity of graph planarity with restricted cyclic orders
Journal of Computer and System Sciences | 2023-04-21 | Paper |
Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Computing proximity drawings of trees in the 3-dimensional space
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Universal slope sets for upward planar drawings
Algorithmica | 2022-08-18 | Paper |
| Polyline Drawings with Topological Constraints | 2022-07-21 | Paper |
Quasi-upward planar drawings with minimum curve complexity
(available as arXiv preprint) | 2022-07-01 | Paper |
Optimal-area visibility representations of outer-1-plane graphs
(available as arXiv preprint) | 2022-07-01 | Paper |
Packing trees into 1-planar graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
On edge-length ratios of partial 2-trees
International Journal of Computational Geometry & Applications | 2022-04-26 | Paper |
Planar drawings with few slopes of Halin graphs and nested pseudotrees
(available as arXiv preprint) | 2022-03-25 | Paper |
Orthogonal planarity testing of bounded treewidth graphs
Journal of Computer and System Sciences | 2022-01-31 | Paper |
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On the Edge-Length Ratio of 2-Trees
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Storyline visualizations with ubiquitous actors
Lecture Notes in Computer Science | 2021-12-01 | Paper |
VAIM: Visual Analytics for Influence Maximization
Lecture Notes in Computer Science | 2021-12-01 | Paper |
\((k,p)\)-planarity: a relaxation of hybrid planarity
Theoretical Computer Science | 2021-11-18 | Paper |
2-colored point-set embeddings of partial 2-trees
Theoretical Computer Science | 2021-11-18 | Paper |
2-colored point-set embeddings of partial 2-trees
WALCOM: Algorithms and Computation | 2021-10-04 | Paper |
Edge Partitions and Visibility Representations of 1-planar Graphs
Beyond Planar Graphs | 2021-07-22 | Paper |
Simultaneous FPQ-ordering and hybrid planarity testing
Theoretical Computer Science | 2021-06-22 | Paper |
| Generalized LR-drawings of trees | 2021-05-14 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Theoretical Computer Science | 2021-03-18 | Paper |
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On the curve complexity of 3-colored point-set embeddings
Theoretical Computer Science | 2020-11-06 | Paper |
Sketched representations and orthogonal planarity of bounded treewidth graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
1-bend upward planar slope number of SP-digraphs
Computational Geometry | 2020-10-23 | Paper |
Colored anchored visibility representations in 2D and 3D space
Computational Geometry | 2020-10-23 | Paper |
Packing trees into 1-planar graphs
(available as arXiv preprint) | 2020-07-22 | Paper |
Simultaneous FPQ-ordering and hybrid planarity testing
Lecture Notes in Computer Science | 2020-07-20 | Paper |
Polyline drawings with topological constraints
Theoretical Computer Science | 2020-01-29 | Paper |
Polyline drawings with topological constraints
Theoretical Computer Science | 2020-01-29 | 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 |
The QuaSEFE Problem
(available as arXiv preprint) | 2019-08-23 | Paper |
NodeTrix planarity testing with small clusters
Algorithmica | 2019-08-20 | Paper |
Universal slope sets for 1-bend planar drawings
Algorithmica | 2019-05-17 | Paper |
On the edge-length ratio of outerplanar graphs
Theoretical Computer Science | 2019-05-02 | Paper |
Beyond outerplanarity
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Colored Point-Set Embeddings of Acyclic Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Edge partitions of optimal 2-plane and 3-plane graphs
Discrete Mathematics | 2019-02-20 | Paper |
On the edge-length ratio of outerplanar graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
NodeTrix planarity testing with small clusters
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Turning cliques into paths to achieve planarity
(available as arXiv preprint) | 2019-02-15 | Paper |
Bend-minimum orthogonal drawings in quadratic time
(available as arXiv preprint) | 2019-02-15 | Paper |
Universal slope sets for upward planar drawings
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Ortho-polygon visibility representations of 3-connected 1-plane graphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
An experimental study on the ply number of straight-line drawings
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
| Monotone simultaneous paths embeddings in \(\mathbb{R}^d\) | 2018-12-10 | Paper |
HV-planarity: algorithms and complexity
Journal of Computer and System Sciences | 2018-12-10 | Paper |
Edge partitions of optimal 2-plane and 3-plane graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Visibility representations of boxes in 2.5 dimensions
Computational Geometry | 2018-10-31 | Paper |
Embedding-preserving rectangle visibility representations of nonplanar graphs
Discrete & Computational Geometry | 2018-10-30 | Paper |
| A universal slope set for 1-bend planar drawings | 2018-08-13 | Paper |
The partial visibility representation extension problem
Algorithmica | 2018-07-25 | Paper |
Ortho-polygon visibility representations of embedded graphs
Algorithmica | 2018-07-25 | Paper |
On the planar split thickness of graphs
Algorithmica | 2018-04-11 | Paper |
New results on edge partitions of 1-plane graphs
Theoretical Computer Science | 2018-02-06 | Paper |
Drawing subcubic planar graphs with four slopes and optimal angular resolution
Theoretical Computer Science | 2018-02-06 | Paper |
| On visibility representations of non-planar graphs | 2018-01-30 | Paper |
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
1-page and 2-page drawings with bounded number of crossings per edge
European Journal of Combinatorics | 2017-11-14 | Paper |
An annotated bibliography on 1-planarity
Computer Science Review | 2017-09-28 | Paper |
On RAC drawings of 1-planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
An experimental study on the ply number of straight-line drawings
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
1-bend upward planar drawings of SP-digraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A distributed multilevel force-directed algorithm
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Placing arrows in directed graph drawings
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Monotone simultaneous embeddings of paths in \(d\) dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
The partial visibility representation extension problem
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Ortho-polygon visibility representations of embedded graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Visibility representations of boxes in 2.5 dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
1-bend RAC drawings of 1-planar graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A million edge drawing for a fistful of dollars
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Recognizing and drawing IC-planar graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Alternating paths and cycles of minimum length
Lecture Notes in Computer Science | 2017-02-10 | Paper |
On partitioning the edges of 1-plane graphs
Theoretical Computer Science | 2017-01-09 | Paper |
Alternating paths and cycles of minimum length
Computational Geometry | 2016-11-14 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Theoretical Computer Science | 2016-08-31 | Paper |
Recognizing and drawing IC-planar graphs
Theoretical Computer Science | 2016-06-01 | Paper |
Lower and upper bounds for long induced paths in 3-connected planar graphs
Theoretical Computer Science | 2016-06-01 | Paper |
Area requirement of visibility representations of trees
Information Processing Letters | 2016-05-26 | Paper |
On the planar split thickness of graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
1-page and 2-page drawings with bounded number of crossings per edge
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Drawing outer 1-planar graphs with few slopes
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
L-visibility drawings of IC-planar graphs
Information Processing Letters | 2016-01-05 | Paper |
Proximity drawings of high-degree trees
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
Straight-Line Drawability of a Planar Graph Plus an Edge
Lecture Notes in Computer Science | 2015-10-30 | Paper |
A linear-time algorithm for testing outer-1-planarity
Algorithmica | 2015-09-02 | Paper |
The approximate rectangle of influence drawability problem
Algorithmica | 2015-07-10 | Paper |
Computing upward topological book embeddings of upward planar digraphs
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Drawing outer 1-planar graphs with few slopes
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
On the complexity of HV-rectilinear planarity testing
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Planar and Quasi Planar Simultaneous Geometric Embedding
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
2-layer right angle crossing drawings
Algorithmica | 2014-12-02 | Paper |
The Planar Slope Number of Subcubic Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Theoretical Computer Science | 2014-01-13 | Paper |
Exploring Complex Drawings via Edge Stratification
Graph Drawing | 2013-12-20 | Paper |
A linear-time algorithm for testing outer-1-planarity
Graph Drawing | 2013-12-20 | Paper |
Planar and plane slope number of partial 2-trees
Graph Drawing | 2013-12-20 | Paper |
Lower and upper bounds for long induced paths in 3-connected planar graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
The crossing-angle resolution in graph drawing
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Area requirement of graph drawings with few crossings per edge
Computational Geometry | 2013-07-31 | Paper |
Approximate proximity drawings
Computational Geometry | 2013-04-29 | Paper |
Right angle crossing graphs and 1-planarity
Discrete Applied Mathematics | 2013-04-25 | Paper |
The approximate rectangle of influence drawability problem
Graph Drawing | 2013-04-03 | 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 |
Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
Graph Drawing | 2013-04-03 | Paper |
Universal point subsets for planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
Hamiltonian orthogeodesic alternating paths
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Large angle crossing drawings of planar graphs in subquadratic area
Lecture Notes in Computer Science | 2013-01-07 | Paper |
\(h\)-quasi planar drawings of bounded treewidth graphs in linear area
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters | 2012-10-23 | Paper |
On point-sets that support planar graphs
Computational Geometry | 2012-10-12 | Paper |
Fáry's theorem for 1-planar graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Universal point sets for 2-coloured trees
Information Processing Letters | 2012-07-20 | Paper |
Heuristics for the maximum 2-layer RAC subgraph problem
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Drawing a tree as a minimum spanning tree approximation
Journal of Computer and System Sciences | 2012-05-11 | Paper |
The shape of orthogonal cycles in three dimensions
Discrete & Computational Geometry | 2012-04-04 | Paper |
A characterization of complete bipartite RAC graphs
Information Processing Letters | 2012-03-19 | Paper |
Bounds on the crossing resolution of complete geometric graphs
Discrete Applied Mathematics | 2012-03-19 | Paper |
On point-sets that support planar graphs
Graph Drawing | 2012-03-09 | Paper |
Right angle crossing graphs and 1-planarity
Graph Drawing | 2012-03-09 | Paper |
Approximate proximity drawings
Graph Drawing | 2012-03-09 | Paper |
2-layer right angle crossing drawings
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Hamiltonian orthogeodesic alternating paths
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Area, curve complexity, and crossing resolution of non-planar graph drawings
Theory of Computing Systems | 2011-11-30 | Paper |
Upward topological book embeddings of DAGs
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Drawing graphs with right angle crossings
Theoretical Computer Science | 2011-10-10 | Paper |
Colored simultaneous geometric embeddings and universal pointsets
Algorithmica | 2011-06-30 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
On graphs supported by line sets
Graph Drawing | 2011-02-11 | Paper |
Universal pointsets for 2-coloured trees
Graph Drawing | 2011-02-11 | Paper |
Topology-driven force-directed algorithms
Graph Drawing | 2011-02-11 | Paper |
Constrained point-set embeddability of planar graphs
International Journal of Computational Geometry & Applications | 2010-12-15 | Paper |
Drawing a tree as a minimum spanning tree approximation
Algorithms and Computation | 2010-12-09 | Paper |
Upward spirality and upward planarity testing
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Matched drawability of graph pairs and of graph triples
Computational Geometry | 2010-07-28 | Paper |
Drawing colored graphs with constrained vertex positions and few bends per edge
Algorithmica | 2010-05-28 | Paper |
Geometric simultaneous embeddings of a graph and a matching
Graph Drawing | 2010-04-27 | Paper |
Area, curve complexity, and crossing resolution of non-planar graph drawings
Graph Drawing | 2010-04-27 | Paper |
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
Discrete & Computational Geometry | 2010-03-04 | Paper |
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Matched drawings of planar graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Visual Analysis of One-To-Many Matched Graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Drawing planar graphs on a curve.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Upward straight-line embeddings of directed graphs into point sets
Computational Geometry | 2009-11-16 | Paper |
Drawing Graphs with Right Angle Crossings
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Point-set embeddings of trees with given partial drawings
Computational Geometry | 2009-07-27 | Paper |
A note on 3D orthogonal drawings with direction constrained edges
Information Processing Letters | 2009-07-21 | Paper |
Volume requirements of 3D upward drawings
Discrete Mathematics | 2009-04-09 | Paper |
Constrained Point-Set Embeddability of Planar Graphs
Graph Drawing | 2009-03-03 | Paper |
Visual Analysis of One-to-Many Matched Graphs
Graph Drawing | 2009-03-03 | Paper |
Embeddability Problems for Upward Planar Digraphs
Graph Drawing | 2009-03-03 | Paper |
Matched Drawability of Graph Pairs and of Graph Triples
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Drawing Colored Graphs on Colored Points
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Drawing Bipartite Graphs on Two Parallel Convex Curves
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Drawing Bipartite Graphs on Two Parallel Convex Curves
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Overlapping Cluster Planarity
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
k-colored Point-set Embeddability of Outerplanar Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
k-colored Point-set Embeddability of Outerplanar Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Computing Radial Drawings on the Minimum Number of Circles
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Computing Radial Drawings on the Minimum Number of Circles
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Upward drawings of triconnected digraphs.
Algorithmica | 2008-12-21 | Paper |
Drawing colored graphs on colored points
Theoretical Computer Science | 2008-12-12 | Paper |
On the parameterized complexity of layered graph drawing
Algorithmica | 2008-12-02 | Paper |
Radial drawings of graphs: geometric constraints and trade-offs
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Computing Upward Topological Book Embeddings of Upward Planar Digraphs
Algorithms and Computation | 2008-05-27 | Paper |
An experimental comparison of four graph drawing algorithms.
Computational Geometry | 2008-04-25 | Paper |
On the Topologies of Local Minimum Spanning Trees
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Matched Drawings of Planar Graphs
Graph Drawing | 2008-03-25 | Paper |
Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge
Graph Drawing | 2008-03-25 | Paper |
Point-Set Embedding of Trees with Edge Constraints
Graph Drawing | 2008-03-25 | Paper |
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
Graph Drawing | 2008-03-25 | Paper |
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
Graph Drawing | 2007-08-28 | Paper |
Drawing Bipartite Graphs on Two Curves
Graph Drawing | 2007-08-28 | Paper |
k-Colored Point-Set Embeddability of Outerplanar Graphs
Graph Drawing | 2007-08-28 | Paper |
SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
International Journal of Computational Geometry & Applications | 2007-05-23 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
The strength of weak proximity
Journal of Discrete Algorithms | 2006-10-31 | Paper |
ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Book embeddability of series-parallel digraphs
Algorithmica | 2006-09-26 | Paper |
\(k\)-spine, 1-bend planarity
Theoretical Computer Science | 2006-09-14 | Paper |
A fixed-parameter approach to 2-layer planarization
Algorithmica | 2006-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry | 2005-11-07 | Paper |
Computing straight-line 3D grid drawings of graphs in linear volume
Computational Geometry | 2005-09-02 | Paper |
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
Curve-constrained drawings of planar graphs
Computational Geometry | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2084273 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084297 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084287 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084262 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080112 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080106 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1974115 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1974108 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1974117 (Why is no real title available?) | 2003-09-03 | Paper |
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry | 2003-05-19 | Paper |
Voronoi drawings of trees
Computational Geometry | 2003-04-28 | Paper |
| scientific article; zbMATH DE number 1875438 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1858605 (Why is no real title available?) | 2003-01-23 | Paper |
Embedding problems for paths with direction constrained edges.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1830717 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1696623 (Why is no real title available?) | 2002-07-22 | Paper |
The drawability problem for minimum weight triangulations
Theoretical Computer Science | 2002-03-03 | Paper |
Drawing directed acyclic graphs: an experimental study
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1500673 (Why is no real title available?) | 2000-11-16 | Paper |
| scientific article; zbMATH DE number 1500675 (Why is no real title available?) | 2000-09-04 | Paper |
Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry | 2000-06-05 | Paper |
Visualizing geometric algorithms over the Web
Computational Geometry | 1999-05-03 | Paper |
Checking the convexity of polytopes and the planarity of subdivisions
Computational Geometry | 1999-04-11 | Paper |
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
SIAM Journal on Computing | 1999-02-22 | Paper |
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing | 1998-09-21 | Paper |
The rectangle of influence drawability problem
Computational Geometry | 1998-06-08 | Paper |
Drawing outerplanar minimum weight triangulations
Information Processing Letters | 1997-02-27 | Paper |
Characterizing proximity trees
Algorithmica | 1997-01-14 | Paper |
