| Publication | Date of Publication | Type |
|---|
| Axis-parallel right angle crossing graphs | 2025-01-06 | Paper |
| On upward-planar L-drawings of graphs | 2024-10-08 | Paper |
| RAC drawings of graphs with low degree | 2024-08-06 | Paper |
| On upward-planar L-drawings of graphs | 2024-08-06 | Paper |
| Recognizing map graphs of bounded treewidth | 2024-05-27 | Paper |
| Recognizing map graphs of bounded treewidth | 2024-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147423 | 2024-01-15 | Paper |
| Morphing triangle contact representations of triangulations | 2023-10-12 | Paper |
| Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario | 2023-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104072 | 2023-06-05 | Paper |
| Bitonic st-orderings for upward planar graphs: the variable embedding setting | 2022-12-21 | Paper |
| Planar L-Drawings of Bimodal Graphs | 2022-11-14 | Paper |
| On mixed linear layouts of series-parallel graphs | 2022-10-21 | Paper |
| Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022) | 2022-09-09 | Paper |
| Morphing Contact Representations of Graphs | 2022-07-18 | Paper |
| One-bend drawings of outerplanar graphs inside simple polygons | 2022-07-01 | Paper |
| Extending Partial Orthogonal Drawings | 2022-06-28 | Paper |
| On morphing 1-planar drawings | 2022-06-08 | Paper |
| Extending Partial Orthogonal Drawings | 2021-12-01 | Paper |
| Planar L-Drawings of Bimodal Graphs | 2021-12-01 | Paper |
| On Mixed Linear Layouts of Series-Parallel Graphs | 2021-12-01 | Paper |
| 2-Layer k-Planar Graphs | 2021-12-01 | Paper |
| Beyond Clustered Planar Graphs | 2021-07-22 | Paper |
| Multi-level Steiner Trees | 2021-04-21 | Paper |
| Multi-Level Steiner Trees. | 2020-12-16 | Paper |
| Geometric representations of dichotomous ordinal data | 2020-02-24 | Paper |
| Beyond level planarity: cyclic, torus, and simultaneous level planarity | 2019-12-27 | Paper |
| Greedy rectilinear drawings | 2019-10-18 | Paper |
| The QuaSEFE Problem | 2019-08-23 | Paper |
| Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity | 2019-08-08 | Paper |
| Hierarchical partial planarity | 2019-05-17 | Paper |
| Clustered planarity with pipes | 2019-05-17 | Paper |
| Universal slope sets for 1-bend planar drawings | 2019-05-17 | Paper |
| Morphing Planar Graph Drawings with a Polynomial Number of Steps | 2019-05-15 | Paper |
| Windrose Planarity | 2019-03-28 | Paper |
| 1-fan-bundle-planar drawings of graphs | 2019-02-20 | Paper |
| On Vertex- and Empty-Ply Proximity Drawings | 2019-02-20 | Paper |
| Greedy rectilinear drawings | 2019-02-15 | Paper |
| Turning cliques into paths to achieve planarity | 2019-02-15 | Paper |
| Testing Planarity of Partially Embedded Graphs | 2018-10-30 | Paper |
| Small universal point sets for \(k\)-outerplanar graphs | 2018-10-30 | Paper |
| A universal slope set for 1-bend planar drawings | 2018-08-13 | Paper |
| Algorithms and bounds for L-drawings of directed graphs | 2018-07-24 | Paper |
| Windrose planarity: embedding graphs with direction-constrained edges | 2018-07-16 | Paper |
| 3-coloring arrangements of line segments with 4 slopes is hard | 2018-06-15 | Paper |
| Clustered Planarity with Pipes | 2018-04-19 | Paper |
| 1-fan-bundle-planar drawings of graphs | 2018-04-04 | Paper |
| Hierarchical partial planarity | 2018-01-04 | 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 |
| Optimal morphs of convex drawings | 2017-10-10 | Paper |
| How to morph planar graph drawings | 2017-05-30 | Paper |
| Strip planarity testing for embedded planar graphs | 2017-05-02 | Paper |
| Vertex-coloring with defects | 2017-04-05 | Paper |
| Beyond level planarity | 2017-02-21 | Paper |
| Low Ply Drawings of Trees | 2017-02-21 | Paper |
| Simultaneous orthogonal planarity | 2017-02-21 | Paper |
| A universal point set for 2-outerplanar graphs | 2017-02-10 | Paper |
| Intersection-link representations of graphs | 2017-02-10 | Paper |
| Monotone drawings of graphs with few directions | 2017-01-31 | Paper |
| SEFE without mapping via large induced outerplane graphs in plane graphs | 2016-06-10 | Paper |
| Vertex-coloring with star-defects | 2016-05-03 | 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 |
| Simultaneous embedding of embedded planar graphs | 2015-12-22 | Paper |
| Testing mutual duality of planar graphs | 2015-07-01 | Paper |
| Monotone drawings of graphs with fixed embedding | 2015-05-26 | Paper |
| Advancements on SEFE and partitioned book embedding problems | 2015-04-01 | 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 (in clustered-level planarity and \(T\)-level planarity) | 2015-01-07 | Paper |
| Anchored drawings of planar graphs | 2015-01-07 | Paper |
| Morphing Planar Graph Drawings Optimally | 2014-07-01 | Paper |
| Universal Point Sets for Drawing Planar Graphs with Circular Arcs | 2014-06-10 | Paper |
| Testing planarity of partially embedded graphs | 2014-05-22 | Paper |
| On Some $\mathcal{NP}$ -complete SEFE Problems | 2014-02-18 | Paper |
| On the area requirements of Euclidean minimum spanning trees | 2014-01-22 | Paper |
| SEFE with no mapping via large induced outerplane graphs in plane graphs | 2014-01-14 | Paper |
| Testing Mutual Duality of Planar Graphs | 2014-01-14 | Paper |
| Morphing Planar Graph Drawings Efficiently | 2013-12-20 | Paper |
| Strip planarity testing | 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 |
| Implementing a partitioned 2-page book embedding testing algorithm | 2013-04-03 | Paper |
| Universal point subsets for planar graphs | 2013-03-21 | Paper |
| Large angle crossing drawings of planar graphs in subquadratic area | 2013-01-07 | Paper |
| Acyclically 3-colorable planar graphs | 2012-12-21 | Paper |
| Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph | 2012-09-13 | Paper |
| Succinct greedy drawings do not always exist | 2012-06-29 | Paper |
| Monotone Drawings of Graphs with Fixed Embedding | 2012-03-09 | Paper |
| Small point sets for simply-nested planar graphs | 2012-03-09 | Paper |
| On a tree and a path with no geometric simultaneous embedding | 2012-01-12 | Paper |
| Monotone drawings of graphs | 2012-01-12 | Paper |
| Simultaneous embedding of embedded planar graphs | 2011-12-16 | Paper |
| On the area requirements of Euclidean minimum spanning trees | 2011-08-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 |
| On the perspectives opened by right angle crossing drawings | 2011-04-19 | Paper |
| Straight-line rectangular drawings of clustered graphs | 2011-03-10 | Paper |
| Upward geometric graph embeddings into point sets | 2011-02-11 | Paper |
| On a tree and a path with no geometric simultaneous embedding | 2011-02-11 | 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 |
| Splitting clusters to get c-planarity | 2010-04-27 | Paper |
| Acyclically 3-colorable planar graphs | 2010-02-09 | Paper |
| An Algorithm to Construct Greedy Drawings of Triangulations | 2010-02-04 | Paper |
| Straight-Line Rectangular Drawings of Clustered Graphs | 2009-10-20 | Paper |
| An Algorithm to Construct Greedy Drawings of Triangulations | 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 |
