Authors are listed alphabetically by last names, as is standard in theoretical computer science, unless marked with an asterisk.
Journal Publications
Hybrid k-Clustering: Blending k-Median and k-Center. ACM Transactions on Computing Theory, 2025. (Link).
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
(Journal version of APPROX 2024 paper)
Fixed-Parameter Algorithms for Fair Hitting Set Problems. Information and Computing, 2025. (Link).
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
(Journal version of MFCS 2023 paper)
FPT approximation for Capacitated Clustering with Outliers. Theoretical Computer Science, 2025. (Link)
Rajni Dabas, Neelima Gupta, Tanmay Inamdar
(Re)packing Equal Disks into Rectangle. Discrete & Computational Geometry, 2024. (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi
(Journal version of ICALP 2022 paper)
FPT approximation and subexponential algorithms for covering few or many edges. Information Processing Letters, 2024. (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Tomohiro Koana
(Journal version of MFCS 2023 paper)
Clustering What Matters: Optimal Approximation for Clustering with Outliers. Journal of Artificial Intelligence Research, 2023. (Link)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, and Jie Xue.
(Journal version of AAAI 2023 Distinguished Paper)
Near-optimal clustering in the k-machine model. Theoretical Computer Science, 2022. (Link)
Sayan Bandyapadhyay, Tanmay Inamdar Shreyas Pai, and Sriram Pemmaraju.
(Journal version of ICDCN 2018 paper)
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory of Computing, 2022. (Link)
Chandra Chekuri, and Tanmay Inamdar.
Algorithms for covering multiple submodular constraints and applications. Journal of Combinatorial Optimization, 2022. (Link)
Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, and Zhao Zhang
Fault-Tolerant Covering Problems in Metric Spaces. Algorithmica, 2020. (Link)
Santanu Bhowmick, Tanmay Inamdar, and Kasturi R. Varadarajan.
Capacitated Covering Problems in Geometric Spaces. Discrete & Computational Geometry, 2019. (Link)
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar and Kasturi R. Varadarajan.
(Journal version of SoCG 2018 paper)
Conference Publications
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization. SODA 2026 (to appear)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi
PTAS for Stabbing Unit Squares and Variants. CCCG 2025
Tanmay Inamdar, Sounak Modak, and Kushal Singanporia
Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. IWOCA 2025 (Link)
Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, and Saket Saurabh
Exact and Parameterized Algorithms for Window Minimization in Bipartite Arrangement. CIAC 2025 (Link)
Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, and Sanjukta Roy.
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering. STACS 2025 (Link, ArXiv)
Ameet Gadekar, and Tanmay Inamdar
Multivariate Exploration of Metric Dilation. STACS 2025 (Link, ArXiv)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, and Saket Saurabh.
Parameterized Geometric Graph Modification with Disk Scaling. ITCS 2025 (Link, ArXiv)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi.
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. ITCS 2025 (Link)
Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar, and Saket Saurabh.
When far is better: The Chamberlin-Courant approach to obnoxious committee selection . FSTTCS 2024 (ArXiv)
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh
Cuts in Graphs with Matroid Constraints. ESA 2024 (Link, ArXiv)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, and Saket Saurabh.
Hybrid k-Clustering: Blending k-Median and k-Center. APPROX 2024 (Link, ArXiv)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi.
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. ICALP 2024 (Link, ArXiv)
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, and Anannya Upasana
Slides
Controlling Delegations in Liquid Democracy. AAMAS 2024 (Link, ArXiv)
Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, and Nimrod Talmon
Exponential-time Approximation Schemes via Compression. ITCS 2024 (Link)
Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, and Saket Saurabh
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS 2023 (Link)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, and Saket Saurabh
Parameterized Complexity of Fair Bisection. ESA 2023 (Link, ArXiv)
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan
Kernelization for Spreading Points. ESA 2023 (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi
Slides
Parameterized and Approximation Algorithms for Maximum Bimodal Subgraph. GD 2023 (Link)
Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen Kobourov, and Marie Diana Sieper
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023 (Link)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, and Saket Saurabh
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023 (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Tomohiro Koana
Proportionally Fair Matching with Multiple Groups. WG 2023 (Link)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, and Kirill Simonov
Slides
Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023 (Link)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, and Kirill Simonov
Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023 (Link)
Sayan Bandyapadhyay, Tanmay Inamdar, and Fedor V. Fomin
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023 Distinguished Paper. (Link)
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, and Jie Xue
Exact Exponential Algorithms for Clustering Problems. IPEC 2022 (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, and Saket Saurabh
(Re)packing Equal Disks into Rectangle. ICALP 2022 (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Meirav Zehavi
Non-Uniform k-Center and Greedy Clustering. SWAT 2022 (Link)
Tanmay Inamdar, and Kasturi R. Varadarajan
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021 (Link)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Saket Saurabh
Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA 2020 (Link)
Tanmay Inamdar, and Kasturi R. Varadarajan
A Constant Approximation for Colorful k-Center. ESA 2019 (Link)
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi R. Varadarajan
Local Search for Geometric Partial Covering Problems. CCCG 2019 (Link)
Tanmay Inamdar
Best student paper award.
Fault Tolerant Clustering with Outliers. WAOA 2019 (Link)
Tanmay Inamdar, and Kasturi R. Varadarajan
Capacitated Covering Problems in Geometric Spaces. SoCG 2018 (Link)
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, and Kasturi R. Varadarajan
On Partial Covering For Geometric Set Systems. SoCG 2018 (Link)
Tanmay Inamdar, and Kasturi R. Varadarajan
Large-Scale Distributed Algorithms for Facility Location with Outliers. OPODIS 2018 (Link)
Tanmay Inamdar, Shreyas Pai, and Sriram Pemmaraju
Near-Optimal Clustering in the k-machine model. ICDCN 2018 (Link)
Sayan Bandyapadhyay, Shreyas Pai, Tanmay Inamdar, and Sriram Pemmaraju
Workshop Papers (without formal proceedings)
Envy-free Allocations with Individual Payments. M-PREF 2025 (ECAI 2025 Workshop)
Eva Deltl, Pranjal Pandey, Robert Bredereck, Tanmay Inamdar, and Pallavi Jain. *