| No. | Title | Author | Year |
|---|---|---|---|
| 1 | (Re)packing Equal Disks into Rectangle | Fomin, Fedor V. et al. | 2022 |
| 2 | Non-Uniform k-Center and Greedy Clustering | Inamdar, Tanmay et al. | 2022 |
| 3 | ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space | Fomin, Fedor V. et al. | 2021 |
| 4 | Capacitated Sum-Of-Radii Clustering: An FPT Approximation | Inamdar, Tanmay et al. | 2020 |
| 5 | A Constant Approximation for Colorful k-Center | Bandyapadhyay, Sayan et al. | 2019 |
| 6 | Capacitated Covering Problems in Geometric Spaces | Bandyapadhyay, Sayan et al. | 2018 |
| 7 | Large-Scale Distributed Algorithms for Facility Location with Outliers | Inamdar, Tanmay et al. | 2018 |
| 8 | On Partial Covering For Geometric Set Systems | Inamdar, Tanmay et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |