| No. |
Title |
Author |
Year |
| 1 |
On Connectivity in Random Graph Models with Limited Dependencies |
Lengler, Johannes et al. |
2023 |
| 2 |
Computational Geometry (Dagstuhl Seminar 9141) |
Alt, Helmut et al. |
2021 |
| 3 |
Computational Geometry (Dagstuhl Seminar 9312) |
Alt, Helmut et al. |
2021 |
| 4 |
An Optimal Decentralized (Δ + 1)-Coloring Algorithm |
Bertschinger, Daniel et al. |
2020 |
| 5 |
Clustering Under Perturbation Stability in Near-Linear Time |
Agarwal, Pankaj K. et al. |
2020 |
| 6 |
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips) |
Wagner, Uli et al. |
2020 |
| 7 |
Convex Hulls of Random Order Types |
Goaoc, Xavier et al. |
2020 |
| 8 |
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems |
Cardinal, Jean et al. |
2018 |
| 9 |
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices |
Pilz, Alexander et al. |
2017 |
| 10 |
Order on Order Types |
Pilz, Alexander et al. |
2015 |
