| No. |
Title |
Author |
Year |
| 1 |
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle |
Bhattacharya, Anup et al. |
2022 |
| 2 |
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! |
Bhattacharya, Anup et al. |
2021 |
| 3 |
Hardness of Approximation for Euclidean k-Median |
Bhattacharya, Anup et al. |
2021 |
| 4 |
Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond |
Bhattacharya, Anup et al. |
2020 |
| 5 |
Noisy, Greedy and Not so Greedy k-Means++ |
Bhattacharya, Anup et al. |
2020 |
| 6 |
On Sampling Based Algorithms for k-Means |
Bhattacharya, Anup et al. |
2020 |
| 7 |
Triangle Estimation Using Tripartite Independent Set Queries |
Bhattacharya, Anup et al. |
2019 |
| 8 |
Approximate Clustering with Same-Cluster Queries |
Ailon, Nir et al. |
2018 |
| 9 |
Faster Algorithms for the Constrained k-Means Problem |
Bhattacharya, Anup et al. |
2016 |
