| Publication | Date of Publication | Type |
|---|
| Unit-length rectangular drawings of graphs | 2024-11-12 | Paper |
| Efficient enumeration of drawings and combinatorial structures for maximal planar graphs | 2024-07-19 | Paper |
| Testing the planar straight-line realizability of 2-trees with prescribed edge lengths | 2024-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147423 | 2024-01-15 | Paper |
| $st$-Orientations with Few Transitive Edges | 2023-12-20 | Paper |
| Small Point-Sets Supporting Graph Stories | 2023-12-20 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
| Upward book embeddability of \(st\)-graphs: complexity and algorithms | 2023-12-13 | Paper |
| Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs | 2023-10-03 | Paper |
| \(st\)-orientations with few transitive edges | 2023-08-16 | Paper |
| Unit-length rectangular drawings of graphs | 2023-08-16 | Paper |
| Small point-sets supporting graph stories | 2023-08-16 | Paper |
| On turn-regular orthogonal representations | 2022-11-14 | Paper |
| Upward book embeddings of st-graphs | 2022-07-18 | 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 |
| Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time | 2021-02-02 | Paper |
| On the area requirements of planar straight-line orthogonal drawings of ternary trees | 2021-01-25 | Paper |
| Graph stories in small area | 2020-10-26 | Paper |
| Upward planar morphs | 2020-10-12 | Paper |
| Graph Stories in Small Area | 2020-09-04 | Paper |
| Visualizing co-phylogenetic reconciliations | 2020-04-06 | 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 |
| LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs | 2019-11-29 | Paper |
| The QuaSEFE Problem | 2019-08-23 | Paper |
| NodeTrix planarity testing with small clusters | 2019-08-20 | Paper |
| Morphing planar graph drawings with a polynomial number of steps | 2019-05-15 | Paper |
| NodeTrix planarity testing with small clusters | 2019-02-20 | Paper |
| Visualizing co-phylogenetic reconciliations | 2019-02-20 | Paper |
| Planar L-drawings of directed graphs | 2019-02-20 | Paper |
| Clustered planarity = flat clustered planarity | 2019-02-15 | Paper |
| Bend-minimum orthogonal drawings in quadratic time | 2019-02-15 | Paper |
| Upward planar morphs | 2019-02-15 | Paper |
| HV-planarity: algorithms and complexity | 2018-12-10 | Paper |
| Testing Planarity of Partially Embedded Graphs | 2018-10-30 | Paper |
| On the area requirements of straight-line orthogonal drawings of ternary trees | 2018-09-06 | Paper |
| Algorithms and bounds for L-drawings of directed graphs | 2018-07-24 | Paper |
| LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs | 2018-07-16 | Paper |
| Computing NodeTrix representations of clustered graphs | 2018-01-12 | Paper |
| Intersection-link representations of graphs | 2017-10-12 | Paper |
| Optimal morphs of convex drawings | 2017-10-10 | Paper |
| How to morph planar graph drawings | 2017-05-30 | Paper |
| Beyond level planarity | 2017-02-21 | Paper |
| Computing NodeTrix representations of clustered graphs | 2017-02-21 | Paper |
| Intersection-link representations of graphs | 2017-02-10 | Paper |
| L-Drawings of Directed Graphs | 2016-03-10 | Paper |
| Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs | 2016-01-15 | Paper |
| Computational complexity of traffic hijacking under BGP and S-BGP | 2015-09-16 | Paper |
| Fan-planarity: properties and complexity | 2015-06-01 | Paper |
| Relaxing the constraints of clustered planarity | 2015-03-06 | Paper |
| On the complexity of HV-rectilinear planarity testing | 2015-01-07 | Paper |
| Anchored drawings of planar graphs | 2015-01-07 | Paper |
| Fan-planar graphs: combinatorial properties and complexity results | 2015-01-07 | Paper |
| Morphing Planar Graph Drawings Optimally | 2014-07-01 | Paper |
| Testing planarity of partially embedded graphs | 2014-05-22 | Paper |
| Upward and quasi-upward planarity testing of embedded mixed graphs | 2014-03-13 | Paper |
| Morphing Planar Graph Drawings Efficiently | 2013-12-20 | Paper |
| Drawing non-planar graphs with crossing-free subgraphs | 2013-12-20 | Paper |
| Topological morphing of planar graphs | 2013-12-11 | Paper |
| Nonconvex Representations of Plane Graphs | 2013-04-09 | 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 |
| Monotone drawings of graphs | 2012-01-12 | 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 |
| Monotone drawings of graphs | 2011-02-11 | Paper |
| Drawing trees in a streaming model | 2010-04-27 | Paper |
| Splitting clusters to get c-planarity | 2010-04-27 | 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 |
| A note on 3D orthogonal drawings with direction constrained edges | 2009-07-21 | Paper |
| On embedding a cycle in a plane graph | 2009-04-09 | Paper |
| Non-convex Representations of Graphs | 2009-03-03 | Paper |
| Topological Morphing of Planar Graphs | 2009-03-03 | Paper |
| Computing a Minimum-Depth Planar Graph Embedding in O(n 4) Time | 2009-02-17 | Paper |
| Clustering Cycles into Cycles of Clusters | 2009-01-19 | Paper |
| C-Planarity of C-Connected Clustered Graphs | 2009-01-19 | Paper |
| Complexity results for three-dimensional orthogonal graph drawing | 2008-11-18 | Paper |
| On the Topologies of Local Minimum Spanning Trees | 2008-04-17 | Paper |
| A Note on Minimum-Area Straight-Line Drawings of Planar Graphs | 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 |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING | 2006-10-16 | Paper |
| Visualizing Interdomain Routing with BGPlay | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024762 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043759 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043781 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472289 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448767 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422270 | 2003-09-03 | Paper |
| Drawing database schemas | 2003-02-04 | Paper |
| On the complexity of orthogonal compaction | 2001-09-09 | Paper |
| A Split&Push Approach to 3D Orthogonal Drawing | 2000-12-14 | Paper |
