| No. |
Title |
Author |
Year |
| 1 |
Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors |
Afshar, Ramtin et al. |
2023 |
| 2 |
Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees |
Afshar, Ramtin et al. |
2022 |
| 3 |
Mapping Networks via Parallel kth-Hop Traceroute Queries |
Afshar, Ramtin et al. |
2022 |
| 4 |
Computational Geometry (Dagstuhl Seminar 99102) |
Goodrich, Michael et al. |
2021 |
| 5 |
Reconstructing Biological and Digital Phylogenetic Trees in Parallel |
Afshar, Ramtin et al. |
2020 |
| 6 |
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width |
Da Lozzo, Giordano et al. |
2019 |
| 7 |
Computing k-Modal Embeddings of Planar Digraphs |
Besa, Juan José et al. |
2019 |
| 8 |
New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs |
Mamano, Nil et al. |
2019 |
| 9 |
Tracking Paths in Planar Graphs |
Eppstein, David et al. |
2019 |
| 10 |
Optimally Sorting Evolving Data |
Besa, Juan Jose et al. |
2018 |
| 11 |
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms |
Barequet, Gill et al. |
2018 |
| 12 |
The Online House Numbering Problem: Min-Max Online List Labeling |
Devanny, William E. et al. |
2017 |
| 13 |
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection |
Besa Vial, Juan José et al. |
2016 |
