| No. |
Title |
Author |
Year |
| 1 |
Escaping the Curse of Spatial Partitioning: Matchings with Low Crossing Numbers and Their Applications |
Csikós, Mónika et al. |
2021 |
| 2 |
Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set |
Mustafa, Nabil H. |
2019 |
| 3 |
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint |
Huang, Chien-Chung et al. |
2019 |
| 4 |
On a Problem of Danzer |
Mustafa, Nabil H. et al. |
2018 |
| 5 |
Optimality of Geometric Local Search |
Jartoux, Bruno et al. |
2018 |
| 6 |
Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs |
Antunes, Daniel et al. |
2017 |
| 7 |
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning |
Dutta, Kunal et al. |
2017 |
| 8 |
Improved Local Search for Geometric Hitting Set |
Bus, Norbert et al. |
2015 |
| 9 |
Near-Optimal Generalisations of a Theorem of Macbeath |
Mustafa, Nabil H. et al. |
2014 |
