| No. |
Title |
Author |
Year |
| 1 |
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable |
Bhore, Sujoy et al. |
2023 |
| 2 |
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) |
Ganian, Robert et al. |
2023 |
| 3 |
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges |
Binucci, Carla et al. |
2023 |
| 4 |
Recognizing Map Graphs of Bounded Treewidth |
Angelini, Patrizio et al. |
2022 |
| 5 |
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) |
Ganian, Robert et al. |
2021 |
| 6 |
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages |
Bekos, Michael A. et al. |
2020 |
| 7 |
Layered Fan-Planar Graph Drawings |
Biedl, Therese et al. |
2020 |
| 8 |
Geodesic Obstacle Representation of Graphs |
Bose, Prosenjit et al. |
2018 |
| 9 |
Polyline Drawings with Topological Constraints |
Di Giacomo, Emilio et al. |
2018 |
| 10 |
A Universal Slope Set for 1-Bend Planar Drawings |
Angelini, Patrizio et al. |
2017 |
| 11 |
On Visibility Representations of Non-Planar Graphs |
Biedl, Therese et al. |
2016 |
