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
18 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
16 * 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 On the partition set cover problem T Inamdar, K Varadarajan
arXiv preprint arXiv:1809.06506, 2018
13 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
12 2023 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 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 Exact exponential algorithms for clustering problems FV Fomin, PA Golovach, T Inamdar, N Purohit, S Saurabh
arXiv preprint arXiv:2208.06847, 2022
4 2022 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
3 2023 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 Fixed-Parameter Algorithms for Fair Hitting Set Problems T Inamdar, L Kanesh, M Kundu, N Purohit, S Saurabh
arXiv preprint arXiv:2307.08854, 2023
2 2023 FPT Approximations for Capacitated/Fair Clustering with Outliers R Dabas, N Gupta, T Inamdar
arXiv preprint arXiv:2305.01471, 2023
2 2023 Covering and clustering with outliers and other constraints T Inamdar
The University of Iowa, 2020
2 2020 
Kasturi VaradarajanProfessor of Computer Science, University of IowaBestätigte E-Mail-Adresse bei uiowa.edu
