No. Title Author Year
1 Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set Mustafa, Nabil H. 2019
2 On a Problem of Danzer Mustafa, Nabil H. et al. 2018
3 Optimality of Geometric Local Search Jartoux, Bruno et al. 2018
4 Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs Antunes, Daniel et al. 2017
5 Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning Dutta, Kunal et al. 2017
6 Improved Local Search for Geometric Hitting Set Bus, Norbert et al. 2015
7 Near-Optimal Generalisations of a Theorem of Macbeath Mustafa, Nabil H. et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI