| No. |
Title |
Author |
Year |
| 1 |
Coresets for Clustering in Geometric Intersection Graphs |
Bandyapadhyay, Sayan et al. |
2023 |
| 2 |
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii |
Bandyapadhyay, Sayan et al. |
2023 |
| 3 |
Minimum-Membership Geometric Set Cover, Revisited |
Bandyapadhyay, Sayan et al. |
2023 |
| 4 |
FPT Approximation for Fair Minimum-Load Clustering |
Bandyapadhyay, Sayan et al. |
2022 |
| 5 |
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs |
Bandyapadhyay, Sayan et al. |
2022 |
| 6 |
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane |
Bandyapadhyay, Sayan et al. |
2021 |
| 7 |
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications |
Bandyapadhyay, Sayan et al. |
2021 |
| 8 |
Parameterized Complexity of Feature Selection for Categorical Data Clustering |
Bandyapadhyay, Sayan et al. |
2021 |
| 9 |
Improved Bounds for Metric Capacitated Covering Problems |
Bandyapadhyay, Sayan |
2020 |
| 10 |
On Perturbation Resilience of Non-Uniform k-Center |
Bandyapadhyay, Sayan |
2020 |
| 11 |
A Constant Approximation for Colorful k-Center |
Bandyapadhyay, Sayan et al. |
2019 |
| 12 |
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames |
Bandyapadhyay, Sayan et al. |
2018 |
| 13 |
Capacitated Covering Problems in Geometric Spaces |
Bandyapadhyay, Sayan et al. |
2018 |
| 14 |
Improved Approximation Bounds for the Minimum Constraint Removal Problem |
Bandyapadhyay, Sayan et al. |
2018 |
| 15 |
Approximate Clustering via Metric Partitioning |
Bandyapadhyay, Sayan et al. |
2016 |
| 16 |
On Variants of k-means Clustering |
Bandyapadhyay, Sayan et al. |
2016 |
