Dutta K, Ghosh A, Jartoux B and Mustafa N.
(2019). Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. Discrete & Computational Geometry. 61:4. (756-777). Online publication date: 1-Jun-2019.
Schulz A and TóTh C.
(2013). The union of colorful simplices spanned by a colored point set. Computational Geometry: Theory and Applications. 46:5. (574-590). Online publication date: 1-Jul-2013.
Ezra E. Small-size relative (p,ε)-approximations for well-behaved range spaces. Proceedings of the twenty-ninth annual symposium on Computational geometry. (233-242).
Ene A, Har-Peled S and Raichel B. Geometric packing under non-uniform constraints. Proceedings of the twenty-eighth annual symposium on Computational geometry. (11-20).
Chan T, Grant E, Könemann J and Sharpe M. Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms. (1576-1585).
Pach J and Tardos G. Tight lower bounds for the size of epsilon-nets. Proceedings of the twenty-seventh annual symposium on Computational geometry. (458-463).
Pettie S. On the structure and composition of forbidden sequences, with geometric applications. Proceedings of the twenty-seventh annual symposium on Computational geometry. (370-379).