| Publication | Date of Publication | Type |
|---|
| Output-sensitive reporting of disjoint paths (extended abstract) | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147423 | 2024-01-15 | Paper |
| On-line convex planarity testing | 2024-01-05 | Paper |
| Small Point-Sets Supporting Graph Stories | 2023-12-20 | Paper |
| Unit-length rectangular drawings of graphs | 2023-08-16 | Paper |
| Small point-sets supporting graph stories | 2023-08-16 | Paper |
| Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) | 2023-01-18 | Paper |
| Computing proximity drawings of trees in the 3-dimensional space | 2022-12-16 | Paper |
| How to draw a series-parallel digraph | 2022-12-09 | Paper |
| On Turn-Regular Orthogonal Representations | 2022-11-14 | Paper |
| Computing orthogonal drawings with the minimum number of bends | 2022-08-19 | Paper |
| From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs | 2022-07-01 | Paper |
| Planar straight-line realizations of 2-trees with prescribed edge lengths | 2022-07-01 | Paper |
| How to morph a tree on a small grid | 2022-03-22 | Paper |
| Schematic Representation of Biconnected Graphs | 2021-12-01 | Paper |
| A Tipping Point for the Planarity of Small and Medium Sized Graphs | 2021-12-01 | Paper |
| On Turn-Regular Orthogonal Representations | 2021-12-01 | Paper |
| Schematic Representation of Large Biconnected Graphs | 2021-06-17 | Paper |
| Extending upward planar graph drawings | 2021-01-07 | Paper |
| Upward planar morphs | 2020-10-12 | Paper |
| Graph Stories in Small Area | 2020-09-04 | Paper |
| Extending upward planar graph drawings | 2020-01-16 | Paper |
| How to morph a tree on a small grid | 2020-01-16 | Paper |
| Beyond level planarity: cyclic, torus, and simultaneous level planarity | 2019-12-27 | Paper |
| Advances on Testing C-Planarity of Embedded Flat Clustered Graphs | 2019-06-24 | Paper |
| Morphing Planar Graph Drawings with a Polynomial Number of Steps | 2019-05-15 | Paper |
| Windrose Planarity | 2019-03-28 | Paper |
| Upward planar morphs | 2019-02-15 | Paper |
| Small universal point sets for \(k\)-outerplanar graphs | 2018-10-30 | Paper |
| Testing Planarity of Partially Embedded Graphs | 2018-10-30 | Paper |
| Windrose Planarity: Embedding Graphs with Direction-Constrained Edges | 2018-07-16 | Paper |
| Computing orthogonal drawings with the minimum number of bends | 2018-07-09 | Paper |
| Computing NodeTrix Representations of Clustered Graphs | 2018-01-12 | Paper |
| On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs | 2018-01-04 | Paper |
| Intersection-Link Representations of Graphs | 2017-10-12 | Paper |
| How to Morph Planar Graph Drawings | 2017-05-30 | Paper |
| Strip planarity testing for embedded planar graphs | 2017-05-02 | Paper |
| Computing NodeTrix Representations of Clustered Graphs | 2017-02-21 | Paper |
| Beyond Level Planarity | 2017-02-21 | Paper |
| Simultaneous Orthogonal Planarity | 2017-02-21 | Paper |
| Intersection-Link Representations of Graphs | 2017-02-10 | Paper |
| SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS | 2015-12-22 | Paper |
| Computational complexity of traffic hijacking under BGP and S-BGP | 2015-09-16 | Paper |
| Reinventing the wheel | 2015-05-07 | Paper |
| Angles of planar triangular graphs | 2015-05-07 | Paper |
| Relaxing the constraints of clustered planarity | 2015-03-06 | Paper |
| The importance of being proper | 2015-01-30 | Paper |
| The Importance of Being Proper | 2015-01-07 | Paper |
| Anchored Drawings of Planar Graphs | 2015-01-07 | Paper |
| Advances on Testing C-Planarity of Embedded Flat Clustered Graphs | 2015-01-07 | Paper |
| On the stability of interdomain routing | 2014-08-13 | Paper |
| Morphing Planar Graph Drawings Optimally | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417619 | 2014-05-22 | Paper |
| On the Queue Number of Planar Graphs | 2014-04-11 | Paper |
| Strip Planarity Testing | 2013-12-20 | Paper |
| Dynamic Traceroute Visualization at Multiple Abstraction Levels | 2013-12-20 | Paper |
| Topological morphing of planar graphs | 2013-12-11 | Paper |
| Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area | 2013-09-25 | Paper |
| Nonconvex Representations of Plane Graphs | 2013-04-09 | Paper |
| Implementing a Partitioned 2-Page Book Embedding Testing Algorithm | 2013-04-03 | Paper |
| Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area | 2013-01-07 | Paper |
| How to Visualize the K-root Name Server | 2012-12-07 | Paper |
| Computational Complexity of Traffic Hijacking under BGP and S-BGP | 2012-11-01 | Paper |
| Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph | 2012-09-13 | Paper |
| Drawing trees in a streaming model | 2012-07-25 | Paper |
| Succinct greedy drawings do not always exist | 2012-06-29 | Paper |
| The shape of orthogonal cycles in three dimensions | 2012-04-04 | Paper |
| Small Point Sets for Simply-Nested Planar Graphs | 2012-03-09 | Paper |
| Monotone Drawings of Graphs | 2012-01-12 | Paper |
| Drawing Graphs on a Smartphone | 2012-01-12 | Paper |
| Simultaneous Embedding of Embedded Planar Graphs | 2011-12-16 | Paper |
| Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time | 2011-07-01 | Paper |
| Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree | 2011-05-19 | Paper |
| On the Perspectives Opened by Right Angle Crossing Drawings | 2011-04-19 | Paper |
| Monotone Drawings of Graphs | 2011-02-11 | Paper |
| On the Perspectives Opened by Right Angle Crossing Drawings | 2010-04-27 | Paper |
| Succinct Greedy Drawings Do Not Always Exist | 2010-04-27 | Paper |
| Drawing Trees in a Streaming Model | 2010-04-27 | Paper |
| Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces | 2010-02-04 | Paper |
| How to draw a clustered tree | 2009-12-10 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| On embedding a graph in the grid with the maximum number of bends and other bad features | 2009-08-06 | Paper |
| Small area drawings of outerplanar graphs | 2009-06-16 | Paper |
| On embedding a cycle in a plane graph | 2009-04-09 | Paper |
| Topological Morphing of Planar Graphs | 2009-03-03 | Paper |
| Non-convex Representations of Graphs | 2009-03-03 | Paper |
| How to Draw a Clustered Tree | 2009-02-17 | Paper |
| Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time | 2009-02-17 | Paper |
| (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective | 2009-01-20 | Paper |
| Clustering Cycles into Cycles of Clusters | 2009-01-19 | Paper |
| C-Planarity of C-Connected Clustered Graphs | 2009-01-19 | Paper |
| Upward drawings of triconnected digraphs. | 2008-12-21 | Paper |
| An experimental comparison of four graph drawing algorithms. | 2008-04-25 | Paper |
| On the Topologies of Local Minimum Spanning Trees | 2008-04-17 | Paper |
| Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces | 2008-03-25 | Paper |
| On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features | 2007-11-15 | Paper |
| Three-Dimensional Drawings of Bounded Degree Trees | 2007-08-28 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| The strength of weak proximity | 2006-10-31 | Paper |
| Visualizing Interdomain Routing with BGPlay | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154375 | 2004-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043705 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043755 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043759 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472302 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472317 | 2004-08-04 | Paper |
| Visualization of the High Level Structure of the Internet with Hermes | 2003-06-23 | Paper |
| Drawing database schemas | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789076 | 2003-01-23 | Paper |
| Embedding problems for paths with direction constrained edges. | 2003-01-21 | Paper |
| Incremental convex planarity testing | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766815 | 2002-07-22 | Paper |
| Quasi-upward planarity | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712307 | 2001-05-06 | Paper |
| DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY | 2001-04-17 | Paper |
| A Split&Push Approach to 3D Orthogonal Drawing | 2000-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501693 | 2000-11-16 | Paper |
| Turn-regularity and optimal area drawings of orthogonal representations | 2000-06-05 | Paper |
| Output-sensitive reporting of disjoint paths | 1999-03-30 | Paper |
| Spirality and Optimal Orthogonal Drawings | 1998-09-21 | Paper |
| Optimal Upward Planarity Testing of Single-Source Digraphs | 1998-05-10 | Paper |
| Angles of Planar Triangular Graphs | 1996-11-20 | Paper |
| On-Line Planarity Testing | 1996-11-07 | Paper |
| On-line maintenance of triconnected components with SPQR-trees | 1996-06-06 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4038721 | 1993-05-18 | Paper |
| A note on optimal area algorithms for upward drawings of binary trees | 1993-05-16 | Paper |
| Area requirement and symmetry display of planar upward drawings | 1992-09-26 | Paper |
| Constrained visibility representations of graphs | 1992-06-28 | Paper |
| Bipartite graphs, upward drawings, and planarity | 1990-01-01 | Paper |
| Algorithms for plane representations of acyclic digraphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796780 | 1988-01-01 | Paper |
| Hierarchies and planarity theory | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785966 | 1987-01-01 | Paper |
