| 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 | 53 | 2019 |
| Near-optimal clustering in the k-machine model S Bandyapadhyay, T Inamdar, S Pai, SV Pemmaraju Theoretical Computer Science 899, 80-97, 2022 | 20* | 2022 |
| Capacitated sum-of-radii clustering: An FPT approximation T Inamdar, K Varadarajan 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 19 | 2020 |
| On partial covering for geometric set systems T Inamdar, K Varadarajan arXiv preprint arXiv:1711.04882, 2017 | 18 | 2017 |
| On metric multi-covering problems S Bhowmick, T Inamdar, K Varadarajan arXiv preprint arXiv:1602.04152, 2016 | 17* | 2016 |
| 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 | 14 | 2018 |
| 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 | 13 | 2023 |
| On the partition set cover problem T Inamdar, K Varadarajan arXiv preprint arXiv:1809.06506, 2018 | 13 | 2018 |
| Fault tolerant clustering with outliers T Inamdar, K Varadarajan International Workshop on Approximation and Online Algorithms, 188-201, 2019 | 9 | 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 | 7 | 2022 |
| Capacitated covering problems in geometric spaces S Bandyapadhyay, S Bhowmick, T Inamdar, K Varadarajan Discrete & Computational Geometry 63 (4), 768-798, 2020 | 7* | 2020 |
| Non-Uniform -Center and Greedy Clustering T Inamdar, K Varadarajan arXiv preprint arXiv:2111.06362, 2021 | 6 | 2021 |
| Local Search for Geometric Partial Covering Problems. T Inamdar CCCG, 242-249, 2019 | 5 | 2019 |
| Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability T Inamdar, D Lokshtanov, S Saurabh, V Surianarayanan arXiv preprint arXiv:2308.10657, 2023 | 4 | 2023 |
| Proportionally fair matching with multiple groups S Bandyapadhyay, FV Fomin, T Inamdar, K Simonov International Workshop on Graph-Theoretic Concepts in Computer Science, 1-15, 2023 | 4 | 2023 |
| Exact exponential algorithms for clustering problems FV Fomin, PA Golovach, T Inamdar, N Purohit, S Saurabh arXiv preprint arXiv:2208.06847, 2022 | 4 | 2022 |
| Fixed-parameter algorithms for Fair Hitting Set problems T Inamdar, L Kanesh, M Kundu, N Purohit, S Saurabh Information and Computation 302, 105261, 2025 | 3 | 2025 |
| Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints T Inamdar, P Jain, D Lokshtanov, A Sahu, S Saurabh, A Upasana arXiv preprint arXiv:2403.07328, 2024 | 2 | 2024 |
| FPT approximation and subexponential algorithms for covering few or many edges FV Fomin, PA Golovach, T Inamdar, T Koana Information Processing Letters 185, 106471, 2024 | 2 | 2024 |
| 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 | 2 | 2023 |
Kasturi VaradarajanProfessor of Computer Science, University of IowaVerified email at uiowa.edu
