| Publication | Date of Publication | Type |
|---|
| Effective Computation of a Feedback Arc Set Using PageRank | 2023-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179343 | 2023-12-16 | Paper |
| Computing a feedback arc set using PageRank | 2023-08-16 | Paper |
| Dominance drawings for DAGs with bounded modular width | 2023-08-14 | Paper |
| How to draw a series-parallel digraph | 2022-12-09 | Paper |
| Orthogonal drawing of high degree graphs with small area and few bends | 2022-08-19 | Paper |
| Algorithms for visualizing phylogenetic networks | 2020-08-17 | Paper |
| Planar drawings of fixed-mobile bigraphs | 2019-10-18 | Paper |
| A New Framework for Hierarchical Drawings | 2019-09-16 | Paper |
| Modifying orthogonal drawings for label placement | 2019-03-26 | Paper |
| Planar drawings of fixed-mobile bigraphs | 2019-02-20 | Paper |
| Planar L-Drawings of Directed Graphs | 2019-02-20 | Paper |
| Algorithms and bounds for drawing directed graphs | 2019-02-15 | Paper |
| Algorithms and Bounds for L-Drawings of Directed Graphs | 2018-07-24 | Paper |
| Interactive orthogonal graph drawing | 2018-07-09 | Paper |
| Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus | 2017-04-05 | Paper |
| Algorithms for visualizing phylogenetic networks | 2017-02-21 | Paper |
| 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus | 2017-02-10 | Paper |
| Area requirement of visibility representations of trees | 2016-05-26 | Paper |
| L-Drawings of Directed Graphs | 2016-03-10 | Paper |
| Algorithms and Bounds for Overloaded Orthogonal Drawings | 2016-03-03 | Paper |
| Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs | 2016-01-15 | Paper |
| Fan-planarity: properties and complexity | 2015-06-01 | Paper |
| Fan-Planar Graphs: Combinatorial Properties and Complexity Results | 2015-01-07 | Paper |
| Drawing Non-Planar Graphs with Crossing-Free Subgraphs | 2013-12-20 | Paper |
| Exploring Complex Drawings via Edge Stratification | 2013-12-20 | Paper |
| DAGView: An Approach for Visualizing Large Graphs | 2013-04-03 | Paper |
| DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations | 2012-12-04 | Paper |
| Overloaded Orthogonal Drawings | 2012-03-09 | Paper |
| Applications of Parameterized st-Orientations | 2011-02-16 | Paper |
| DAGmaps and ε-Visibility Representations of DAGs | 2010-04-27 | Paper |
| DAGmaps: Space Filling Visualization of Directed Acyclic Graphs | 2010-02-04 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Algorithms for computing a parameterized \(st\)-orientation | 2008-12-12 | Paper |
| On the Topologies of Local Minimum Spanning Trees | 2008-04-17 | Paper |
| Treemaps for Directed Acyclic Graphs | 2008-03-25 | Paper |
| A framework and algorithms for circular drawings of graphs | 2008-01-11 | Paper |
| Parameterized st-Orientations of Graphs: Algorithms and Experiments | 2007-08-28 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Algorithms for the multiple label placement problem | 2006-10-25 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154375 | 2004-12-16 | Paper |
| A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043703 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043785 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472301 | 2004-08-04 | Paper |
| Automatic layout of statecharts | 2002-06-02 | Paper |
| On the complexity of the Edge Label Placement problem | 2002-01-02 | Paper |
| THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING | 2001-04-17 | Paper |
| Techniques for the Refinement of Orthogonal Graph Drawings | 2000-12-14 | Paper |
| Efficient orthogonal drawings of high degree graphs | 2000-12-12 | Paper |
| Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions | 2000-09-19 | Paper |
| Algorithms for area-efficient orthogonal drawing | 1998-07-01 | Paper |
| Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs | 1996-04-11 | Paper |
| HOW TO DRAW A SERIES-PARALLEL DIGRAPH | 1995-04-06 | Paper |
| Algorithms for drawing graphs: An annotated bibliography | 1994-11-30 | Paper |
| Dynamic reachability in planar digraphs with one source and one sink | 1993-11-28 | Paper |
| Area requirement and symmetry display of planar upward drawings | 1992-09-26 | Paper |
| Constrained visibility representations of graphs | 1992-06-28 | Paper |
| Lower bounds for planar orthogonal drawings of graphs | 1992-06-27 | Paper |
| Representations of Graphs on a Cylinder | 1991-01-01 | Paper |
| Wiring layouts in the tri-hexagonal grid∗ | 1990-01-01 | Paper |
| On finding a minimum vertex cover of a series-parallel graph | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4732413 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785982 | 1987-01-01 | Paper |
| A unified approach to visibility representations of planar graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742736 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315556 | 1983-01-01 | Paper |
