Improved Approximation for Metric Multi-Cover. - Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (CoRR, 2016)

A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. - Sayan Bandyapadhyay; Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (CoRR, 2017)

On Partial Covering For Geometric Set Systems. - Tanmay Inamdar 002; Kasturi R. Varadarajan (SoCG, 2018)

Near-Optimal Clustering in the k-machine model. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Sriram V. Pemmaraju (ICDCN, 2018)

Large-Scale Distributed Algorithms for Facility Location with Outliers. - Tanmay Inamdar 002; Shreyas Pai; Sriram V. Pemmaraju (OPODIS, 2018)

On the Partition Set Cover Problem. - Tanmay Inamdar 002; Kasturi R. Varadarajan (CoRR, 2018)

Local Search for Geometric Partial Covering Problems. - Tanmay Inamdar 002 (CCCG, 2019)

A Constant Approximation for Colorful k-Center. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Kasturi R. Varadarajan (ESA, 2019)

Fault Tolerant Clustering with Outliers. - Tanmay Inamdar 002; Kasturi R. Varadarajan (WAOA, 2019)

Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. - Chandra Chekuri; Tanmay Inamdar 002 (CoRR, 2019)

Capacitated Sum-Of-Radii Clustering: An FPT Approximation. - Tanmay Inamdar 002; Kasturi R. Varadarajan (ESA, 2020)

Capacitated Covering Problems in Geometric Spaces. - Sayan Bandyapadhyay; Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (Discret. Comput. Geom., 2020)

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001 (FSTTCS, 2021)

Fault-Tolerant Covering Problems in Metric Spaces. - Santanu Bhowmick; Tanmay Inamdar 002; Kasturi R. Varadarajan (Algorithmica, 2021)

(Re)packing Equal Disks into Rectangle. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Meirav Zehavi (ICALP, 2022)

Exact Exponential Algorithms for Clustering Problems. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Nidhi Purohit; Saket Saurabh 001 (IPEC, 2022)

Non-Uniform k-Center and Greedy Clustering. - Tanmay Inamdar 002; Kasturi R. Varadarajan (SWAT, 2022)

Algorithms for covering multiple submodular constraints and applications. - Chandra Chekuri; Tanmay Inamdar 002; Kent Quanrud; Kasturi R. Varadarajan; Zhao Zhang 002 (J. Comb. Optim., 2022)

Near-optimal clustering in the k-machine model. - Sayan Bandyapadhyay; Tanmay Inamdar 002; Shreyas Pai; Sriram V. Pemmaraju (Theor. Comput. Sci., 2022)

Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. - Chandra Chekuri; Tanmay Inamdar 002 (Adv. Math. Commun., 2022)

Coresets for Clustering in Geometric Intersection Graphs. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002 (SoCG, 2023)

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). - Tanmay Inamdar 002; Daniel Lokshtanov; Saket Saurabh 001; Vaishali Surianarayanan (ESA, 2023)

Kernelization for Spreading Points. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (ESA, 2023)

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. - Tanmay Inamdar 002; Lawqueen Kanesh; Madhumita Kundu; M. S. Ramanujan 001; Saket Saurabh 001 (FSTTCS, 2023)

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. - Walter Didimo; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Stephen G. Kobourov; Marie Diana Sieper (GD (2), 2023)

Socially Fair Matching: Exact and Approximation Algorithms. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Fahad Panolan; Kirill Simonov (WADS, 2023)

Proportionally Fair Matching with Multiple Groups. - Sayan Bandyapadhyay; Fedor V. Fomin; Tanmay Inamdar 002; Kirill Simonov (WG, 2023)

FPT Approximations for Capacitated/Fair Clustering with Outliers. - Rajni Dabas; Neelima Gupta; Tanmay Inamdar 002 (CoRR, 2023)

Clustering what Matters: Optimal Approximation for Clustering with Outliers. - Akanksha Agrawal 001; Tanmay Inamdar 002; Saket Saurabh 001; Jie Xue 003 (J. Artif. Intell. Res., 2023)

Hybrid k-Clustering: Blending k-Median and k-Center. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (APPROX/RANDOM, 2024)

Controlling Delegations in Liquid Democracy. - Shiri Alouf-Heffetz; Tanmay Inamdar 002; Pallavi Jain 001; Nimrod Talmon; Yash More Hiren (AAMAS, 2024)

Cuts in Graphs with Matroid Constraints. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (ESA, 2024)

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. - Sushmita Gupta; Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2024)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. - Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (ICALP, 2024)

Exponential-Time Approximation Schemes via Compression. - Tanmay Inamdar 002; Madhumita Kundu; Pekka Parviainen; M. S. Ramanujan 001; Saket Saurabh 001 (ITCS, 2024)

FPT approximation and subexponential algorithms for covering few or many edges. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Tomohiro Koana (Inf. Process. Lett., 2024)

(Re)packing Equal Disks into Rectangle. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)

Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. - Shashank Chauhan; Tanmay Inamdar 002; Lawqueen Kanesh; Sanjukta Roy 001 (CIAC (2), 2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. - Matthias Bentert; Fedor V. Fomin; Tanmay Inamdar 002; Saket Saurabh 001 (ITCS, 2025)

Parameterized Geometric Graph Modification with Disk Scaling. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Saket Saurabh 001; Meirav Zehavi (ITCS, 2025)

Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. - Tanmay Inamdar 002; Lawqueen Kanesh; R. Krithika 001; Harshil Mittal; Saket Saurabh 001 (IWOCA, 2025)

Multivariate Exploration of Metric Dilation. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (STACS, 2025)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. - Ameet Gadekar; Tanmay Inamdar 002 (STACS, 2025)

Fixed-parameter algorithms for Fair Hitting Set problems. - Tanmay Inamdar 002; Lawqueen Kanesh; Madhumita Kundu; Nidhi Purohit; Saket Saurabh 001 (Inf. Comput., 2025)

FPT approximation for capacitated clustering with outliers. - Rajni Dabas; Neelima Gupta; Tanmay Inamdar 002 (Theor. Comput. Sci., 2025)

Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means. - Sujoy Bhore; Ameet Gadekar; Tanmay Inamdar 002 (CoRR, 2025)