No. |
Title |
Author |
Year |
1 |
The Tragedy of Being Almost but Not Quite Planar (Invited Talk) |
Erickson, Jeff |
2022 |
2 |
Chasing Puppies: Mobile Beacon Routing on Closed Curves |
Abrahamsen, Mikkel et al. |
2021 |
3 |
A Toroidal Maxwell-Cremona-Delaunay Correspondence |
Erickson, Jeff et al. |
2020 |
4 |
Computational Geometry (Dagstuhl Seminar 19181) |
Cheng, Siu-Wing et al. |
2019 |
5 |
Lower Bounds for Electrical Reduction on Surfaces |
Chang, Hsien-Chih et al. |
2019 |
6 |
Topologically Trivial Closed Walks in Directed Surface Graphs |
Erickson, Jeff et al. |
2019 |
7 |
Computational Geometry (Dagstuhl Seminar 17171) |
Cheong, Orfried et al. |
2017 |
8 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) |
Erickson, Jeff et al. |
2016 |
9 |
Recognizing Weakly Simple Polygons |
Akitaya, Hugo A. et al. |
2016 |
10 |
Untangling Planar Curves |
Chang, Hsien-Chih et al. |
2016 |
11 |
Computational Geometry (Dagstuhl Seminar 15111) |
Cheong, Otfried et al. |
2015 |