| No. |
Title |
Author |
Year |
| 1 |
Coresets for Clustering in Geometric Intersection Graphs |
Bandyapadhyay, Sayan et al. |
2023 |
| 2 |
Fixed-Parameter Algorithms for Fair Hitting Set Problems |
Inamdar, Tanmay et al. |
2023 |
| 3 |
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges |
Fomin, Fedor V. et al. |
2023 |
| 4 |
Kernelization for Spreading Points |
Fomin, Fedor V. et al. |
2023 |
| 5 |
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability) |
Inamdar, Tanmay et al. |
2023 |
| 6 |
(Re)packing Equal Disks into Rectangle |
Fomin, Fedor V. et al. |
2022 |
| 7 |
Exact Exponential Algorithms for Clustering Problems |
Fomin, Fedor V. et al. |
2022 |
| 8 |
Non-Uniform k-Center and Greedy Clustering |
Inamdar, Tanmay et al. |
2022 |
| 9 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |
| 10 |
Capacitated Sum-Of-Radii Clustering: An FPT Approximation |
Inamdar, Tanmay et al. |
2020 |
| 11 |
A Constant Approximation for Colorful k-Center |
Bandyapadhyay, Sayan et al. |
2019 |
| 12 |
Capacitated Covering Problems in Geometric Spaces |
Bandyapadhyay, Sayan et al. |
2018 |
| 13 |
Large-Scale Distributed Algorithms for Facility Location with Outliers |
Inamdar, Tanmay et al. |
2018 |
| 14 |
On Partial Covering For Geometric Set Systems |
Inamdar, Tanmay et al. |
2018 |
