| Publication | Date of Publication | Type |
|---|
| Recognizing map graphs of bounded treewidth | 2024-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147423 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179343 | 2023-12-16 | Paper |
| Upward book embeddability of \(st\)-graphs: complexity and algorithms | 2023-12-13 | Paper |
| Book embeddings of nonplanar graphs with small faces in few pages | 2023-11-02 | Paper |
| Book embeddings of \(k\)-framed graphs and \(k\)-map graphs | 2023-10-30 | Paper |
| Morphing triangle contact representations of triangulations | 2023-10-12 | Paper |
| Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs | 2023-10-03 | Paper |
| Unit-length rectangular drawings of graphs | 2023-08-16 | Paper |
| Recognizing DAGs with page-number 2 is NP-complete | 2023-08-16 | Paper |
| On the upward book thickness problem: combinatorial and complexity results | 2023-04-27 | Paper |
| C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. | 2023-02-03 | Paper |
| Recognizing DAGs with page-number 2 is NP-complete | 2023-02-01 | Paper |
| Planar L-Drawings of Bimodal Graphs | 2022-11-14 | Paper |
| Approximation Algorithms for Facial Cycles in Planar Embeddings | 2022-07-21 | Paper |
| Morphing Contact Representations of Graphs | 2022-07-18 | 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 |
| On the upward book thickness problem: combinatorial and complexity results | 2022-07-01 | Paper |
| Computing k-modal embeddings of planar digraphs | 2022-05-11 | Paper |
| Graph Product Structure for h-Framed Graphs | 2022-04-25 | Paper |
| Planar drawings with few slopes of Halin graphs and nested pseudotrees | 2022-03-25 | Paper |
| How to morph a tree on a small grid | 2022-03-22 | Paper |
| Planar L-Drawings of Bimodal Graphs | 2021-12-01 | Paper |
| 2-Layer k-Planar Graphs | 2021-12-01 | Paper |
| C-planarity testing of embedded clustered graphs with bounded dual carving-width | 2021-07-26 | Paper |
| Beyond Clustered Planar Graphs | 2021-07-22 | Paper |
| On the area requirements of planar greedy drawings of triconnected planar graphs | 2021-04-21 | Paper |
| Extending upward planar graph drawings | 2021-01-07 | 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 |
| On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs | 2020-03-01 | Paper |
| Reaching 3-connectivity via edge-edge additions | 2020-02-25 | Paper |
| Extending upward planar graph drawings | 2020-01-16 | Paper |
| How to morph a tree on a small grid | 2020-01-16 | Paper |
| On planar greedy drawings of 3-connected planar graphs | 2019-12-30 | Paper |
| Beyond level planarity: cyclic, torus, and simultaneous level planarity | 2019-12-27 | Paper |
| Planarity of streamed graphs | 2019-11-13 | Paper |
| Clustered planarity with pipes | 2019-05-17 | Paper |
| Windrose Planarity | 2019-03-28 | Paper |
| Drawing planar graphs with many collinear vertices | 2019-02-27 | Paper |
| Planar L-Drawings of Directed Graphs | 2019-02-20 | Paper |
| Upward planar morphs | 2019-02-15 | Paper |
| Subexponential-time and FPT algorithms for embedded flat clustered planarity | 2018-11-22 | Paper |
| Analogies between the crossing number and the tangle crossing number | 2018-11-22 | Paper |
| On planar greedy drawings of 3-connected planar graphs | 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 |
| 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 |
| 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 |
| Computing NodeTrix Representations of Clustered Graphs | 2017-02-21 | Paper |
| Drawing Planar Graphs with Many Collinear Vertices | 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 |
| Strengthening Hardness Results to 3-Connected Planar Graphs | 2016-07-08 | 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 |
| Planarity of streamed graphs | 2015-09-21 | Paper |
| Planar Embeddings with Small and Uniform Faces | 2015-09-11 | 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 | 2015-01-07 | Paper |
| Anchored Drawings of Planar Graphs | 2015-01-07 | Paper |
| Morphing Planar Graph Drawings Optimally | 2014-07-01 | Paper |
| On Some $\mathcal{NP}$ -complete SEFE Problems | 2014-02-18 | Paper |
| Strip Planarity Testing | 2013-12-20 | Paper |
| Drawing Non-Planar Graphs with Crossing-Free Subgraphs | 2013-12-20 | Paper |
| Drawing Graphs on a Smartphone | 2012-01-12 | Paper |
