| No. |
Title |
Author |
Year |
| 1 |
Bounding and Computing Obstacle Numbers of Graphs |
Balko, Martin et al. |
2022 |
| 2 |
Long Plane Trees |
Cabello, Sergio et al. |
2022 |
| 3 |
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries |
Erlebach, Thomas et al. |
2021 |
| 4 |
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian |
Hoffmann, Michael et al. |
2019 |
| 5 |
Convex Hulls in Polygonal Domains |
Barba, Luis et al. |
2018 |
| 6 |
Two-Planar Graphs Are Quasiplanar |
Hoffmann, Michael et al. |
2017 |
| 7 |
The Planar Tree Packing Theorem |
Geyer, Markus et al. |
2016 |
| 8 |
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations |
Cardinal, Jean et al. |
2015 |
| 9 |
Computing Minimum Spanning Trees with Uncertainty |
Hoffmann, Michael et al. |
2008 |
| 10 |
Network Discovery and Verification |
Beerliova, Zuzana et al. |
2005 |
