| Publication | Date of Publication | Type |
|---|
Weakly leveled planarity with bounded span
Theoretical Computer Science | 2026-03-30 | Paper |
| Weakly leveled planarity with bounded span | 2025-10-07 | Paper |
A fixed-parameter algorithm for dominance drawings of DAGs
Theoretical Computer Science | 2024-11-07 | Paper |
Effective Computation of a Feedback Arc Set Using PageRank
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
Computing a feedback arc set using PageRank
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Dominance drawings for DAGs with bounded modular width
Lecture Notes in Computer Science | 2023-08-14 | Paper |
How to draw a series-parallel digraph
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Orthogonal drawing of high degree graphs with small area and few bends
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Algorithms for visualizing phylogenetic networks
Theoretical Computer Science | 2020-08-17 | Paper |
Planar drawings of fixed-mobile bigraphs
Theoretical Computer Science | 2019-10-18 | Paper |
A new framework for hierarchical drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
Modifying orthogonal drawings for label placement
Algorithms | 2019-03-26 | Paper |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Planar drawings of fixed-mobile bigraphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Algorithms and bounds for drawing directed graphs
(available as arXiv preprint) | 2019-02-15 | Paper |
Algorithms and bounds for L-drawings of directed graphs
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Interactive orthogonal graph drawing
IEEE Transactions on Computers | 2018-07-09 | Paper |
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Algorithms for visualizing phylogenetic networks
Lecture Notes in Computer Science | 2017-02-21 | Paper |
2-layer fan-planarity: from caterpillar to stegosaurus
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Area requirement of visibility representations of trees
Information Processing Letters | 2016-05-26 | Paper |
L-Drawings of Directed Graphs
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Algorithms and bounds for overloaded orthogonal drawings
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
Computational Geometry | 2016-01-15 | Paper |
Fan-planarity: properties and complexity
Theoretical Computer Science | 2015-06-01 | Paper |
Fan-planar graphs: combinatorial properties and complexity results
Graph Drawing | 2015-01-07 | Paper |
Drawing non-planar graphs with crossing-free subgraphs
Graph Drawing | 2013-12-20 | Paper |
Exploring Complex Drawings via Edge Stratification
Graph Drawing | 2013-12-20 | Paper |
Dagview: an approach for visualizing large graphs
Graph Drawing | 2013-04-03 | Paper |
DAGmaps and \(\varepsilon \)-visibility representations for DAGs: algorithms and characterizations
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Overloaded orthogonal drawings
Graph Drawing | 2012-03-09 | Paper |
Applications of parameterized \(st\)-orientations
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
DAGmaps and \(\varepsilon \)-visibility representations of DAGs
Graph Drawing | 2010-04-27 | Paper |
DAGmaps: space filling visualization of directed acyclic graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms for computing a parameterized \(st\)-orientation
Theoretical Computer Science | 2008-12-12 | Paper |
On the Topologies of Local Minimum Spanning Trees
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Treemaps for Directed Acyclic Graphs
Graph Drawing | 2008-03-25 | Paper |
A framework and algorithms for circular drawings of graphs
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Parameterized st-Orientations of Graphs: Algorithms and Experiments
Graph Drawing | 2007-08-28 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Algorithms for the multiple label placement problem
Computational Geometry | 2006-10-25 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2123123 (Why is no real title available?) | 2004-12-16 | Paper |
A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2084265 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084317 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080093 (Why is no real title available?) | 2004-08-04 | Paper |
Automatic layout of statecharts
Software. Practice & Experience | 2002-06-02 | Paper |
On the complexity of the Edge Label Placement problem
Computational Geometry | 2002-01-02 | Paper |
The three-phase method: a unified approach to orthogonal graph drawing
International Journal of Computational Geometry & Applications | 2001-04-17 | Paper |
Techniques for the Refinement of Orthogonal Graph Drawings
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Techniques for the Refinement of Orthogonal Graph Drawings
Journal of Graph Algorithms and Applications | 2000-12-14 | Paper |
Efficient orthogonal drawings of high degree graphs
Algorithmica | 2000-12-12 | Paper |
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
Journal of Graph Algorithms and Applications | 2000-09-19 | Paper |
Algorithms for area-efficient orthogonal drawing
Computational Geometry | 1998-07-01 | Paper |
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
SIAM Journal on Computing | 1996-04-11 | Paper |
HOW TO DRAW A SERIES-PARALLEL DIGRAPH
International Journal of Computational Geometry & Applications | 1995-04-06 | Paper |
Algorithms for drawing graphs: An annotated bibliography
Computational Geometry | 1994-11-30 | Paper |
Dynamic reachability in planar digraphs with one source and one sink
Theoretical Computer Science | 1993-11-28 | Paper |
Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry | 1992-09-26 | Paper |
Constrained visibility representations of graphs
Information Processing Letters | 1992-06-28 | Paper |
Lower bounds for planar orthogonal drawings of graphs
Information Processing Letters | 1992-06-27 | Paper |
Representations of Graphs on a Cylinder
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
Wiring layouts in the tri-hexagonal grid∗
International Journal of Computer Mathematics | 1990-01-01 | Paper |
On finding a minimum vertex cover of a series-parallel graph
Applied Mathematics Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4118301 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4049090 (Why is no real title available?) | 1987-01-01 | Paper |
A unified approach to visibility representations of planar graphs
Discrete & Computational Geometry | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3978410 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3845637 (Why is no real title available?) | 1983-01-01 | Paper |
