Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
On the Geometric Set Multicover Problem | Discrete & Computational Geometry |
| 2 | 2022 |
Approximation algorithms for polynomial-expansion and low-density graphs | SIAM Journal on Computing |
| 2017 | |
Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces | SIAM Journal on Computing |
| 2015 | |
Exact algorithms and APX-hardness results for geometric packing and covering problems | Computational Geometry |
| 25 | 2014 |
The Geometry of Scheduling | SIAM Journal on Computing |
| 13 | 2014 |