| A Constant Approximation for Colorful k-Center S Bandyapadhyay, T Inamdar, S Pai, K Varadarajan 27th Annual European Symposium on Algorithms, (ESA) 2019 144, 12:1--12:14, 2019 | 43 | 2019 |
| On partial covering for geometric set systems T Inamdar, K Varadarajan arXiv preprint arXiv:1711.04882, 2017 | 17 | 2017 |
| Near-optimal clustering in the k-machine model S Bandyapadhyay, T Inamdar, S Pai, SV Pemmaraju Proceedings of the 19th International Conference on distributed computing …, 2018 | 16 | 2018 |
| On metric multi-covering problems S Bhowmick, T Inamdar, K Varadarajan arXiv preprint arXiv:1602.04152, 2016 | 15* | 2016 |
| On the partition set cover problem T Inamdar, K Varadarajan arXiv preprint arXiv:1809.06506, 2018 | 12 | 2018 |
| Large-Scale Distributed Algorithms for Facility Location with Outliers T Inamdar, S Pai, SV Pemmaraju 22nd International Conference on Principles of Distributed Systems, 5:1--5:16, 2018 | 10 | 2018 |
| Capacitated sum-of-radii clustering: An FPT approximation T Inamdar, K Varadarajan 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 7 | 2020 |
| Fault tolerant clustering with outliers T Inamdar, K Varadarajan International Workshop on Approximation and Online Algorithms, 188-201, 2019 | 7 | 2019 |
| Capacitated covering problems in geometric spaces S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan Discrete & Computational Geometry 63 (4), 768-798, 2020 | 6* | 2020 |
| Non-Uniform -Center and Greedy Clustering T Inamdar, K Varadarajan arXiv preprint arXiv:2111.06362, 2021 | 5 | 2021 |
| Local Search for Geometric Partial Covering Problems. T Inamdar CCCG, 242-249, 2019 | 4 | 2019 |
| Algorithms for covering multiple submodular constraints and applications C Chekuri, T Inamdar, K Quanrud, K Varadarajan, Z Zhang Journal of combinatorial optimization 44 (2), 979-1010, 2022 | 3 | 2022 |
| Capacitated covering problems in geometric spaces S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan arXiv preprint arXiv:1707.05170, 2017 | 2 | 2017 |
| Clustering what matters: optimal approximation for clustering with outliers A Agrawal, T Inamdar, S Saurabh, J Xue Journal of Artificial Intelligence Research 78, 143-166, 2023 | 1 | 2023 |
| Proportionally Fair Matching with Multiple Groups S Bandyapadhyay, FV Fomin, T Inamdar, K Simonov arXiv preprint arXiv:2301.03862, 2023 | 1 | 2023 |
| Exact Exponential Algorithms for Clustering Problems FV Fomin, PA Golovach, T Inamdar, N Purohit, S Saurabh arXiv preprint arXiv:2208.06847, 2022 | 1 | 2022 |
| Near-optimal clustering in the k-machine model S Bandyapadhyay, T Inamdar, S Pai, SV Pemmaraju Theoretical computer science 899, 80-97, 2022 | 1 | 2022 |
| Covering and clustering with outliers and other constraints T Inamdar The University of Iowa, 2020 | 1 | 2020 |
| Algorithms for intersection graphs of multiple intervals and pseudo disks C Chekuri, T Inamdar arXiv preprint arXiv:1911.01374, 2019 | 1 | 2019 |
| FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less T Inamdar, L Kanesh, M Kundu, MS Ramanujan, S Saurabh arXiv preprint arXiv:2310.03469, 2023 | | 2023 |
