Publications

1.  (Re)packing Equal Disks into Rectangle. Discrete & Computational Geometry. (Link)
   Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi
   (Journal version of ICALP 2022 paper)
   
   

2. FPT approximation and subexponential algorithms for covering few or many edges. Information Processing Letters. (Link)
   Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Tomohiro Koana
   (Journal version of MFCS 2023 paper)
   
   

3. Clustering What Matters: Optimal Approximation for Clustering with Outliers.  Journal of Artificial Intelligence Research. (Link)
   Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, and Jie Xue.
   (Journal version of AAAI 2023 Distinguished Paper)
   
   

4. Near-optimal clustering in the k-machine model. Theoretical Computer Science. (Link)

Sayan Bandyapadhyay, Tanmay Inamdar Shreyas Pai, and Sriram Pemmaraju.

(Journal version of ICDCN 2018 paper) 

5. Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory of Computing. (Link)

Chandra Chekuri, and Tanmay Inamdar.

6. Algorithms for covering multiple submodular constraints and applications.  Journal of Combinatorial Optimization. (Link)

Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, and Zhao Zhang

7. Fault-Tolerant Covering Problems in Metric Spaces. Algorithmica. (Link)

Santanu Bhowmick, Tanmay Inamdar, and Kasturi R. Varadarajan.

8. Capacitated Covering Problems in Geometric Spaces. Discrete & Computational Geometry. (Link)

Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar and Kasturi R. Varadarajan. 

(Journal version of SoCG 2018 paper)

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

2. Controlling Delegations in Liquid Democracy. AAMAS 2024 (Link, ArXiv)
   Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Yash More, and Nimrod Talmon
   
   

3. Exponential-time Approximation Schemes via Compression. ITCS 2024 (Link)
   Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, and Saket Saurabh
   
   

4. 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
   
   

5. Parameterized Complexity of Fair Bisection. ESA 2023  (Link, ArXiv)
   Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan
   
   

6. Kernelization for Spreading Points. ESA 2023 (Link)
   Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi
   Slides
   
   

7. 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
   
   

8. Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023 (Link)
   Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, and Saket Saurabh
   
   

9. 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
   
   

10. Proportionally Fair Matching with Multiple Groups. WG 2023 (Link)
    Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, and Kirill Simonov
    Slides
    
    

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

12. Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023 (Link)
    Sayan Bandyapadhyay, Tanmay Inamdar, and Fedor V. Fomin
    
    

13. Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023  Distinguished Paper. (Link)

Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, and Jie Xue

Slides

14. Exact Exponential Algorithms for Clustering Problems. IPEC 2022 (Link)

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, and Saket Saurabh

15. (Re)packing Equal Disks into Rectangle. ICALP 2022 (Link)

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Meirav Zehavi

Slides

16. Non-Uniform k-Center and Greedy Clustering. SWAT 2022 (Link)

Tanmay Inamdar, and Kasturi R. Varadarajan

Slides

17. ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. FSTTCS 2021 (Link)

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, and Saket Saurabh

Slides

18. Capacitated Sum-Of-Radii Clustering: An FPT Approximation. ESA 2020 (Link)

Tanmay Inamdar, and Kasturi R. Varadarajan

Poster

19. A Constant Approximation for Colorful k-Center. ESA 2019 (Link)

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi R. Varadarajan

Slides

20. Local Search for Geometric Partial Covering Problems. CCCG 2019 (Link)
    Tanmay Inamdar

Best student paper award.

Slides

21. Fault Tolerant Clustering with Outliers. WAOA 2019 (Link)

Tanmay Inamdar, and Kasturi R. Varadarajan

Slides

22. Capacitated Covering Problems in Geometric Spaces. SoCG 2018 (Link)

Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, and Kasturi R. Varadarajan

23. On Partial Covering For Geometric Set Systems. SoCG 2018 (Link)

Tanmay Inamdar, and Kasturi R. Varadarajan

Slides

24. Large-Scale Distributed Algorithms for Facility Location with Outliers. OPODIS 2018 (Link)

Tanmay Inamdar, Shreyas Pai, and Sriram Pemmaraju

25. Near-Optimal Clustering in the k-machine model. ICDCN 2018 (Link)

Sayan Bandyapadhyay, Shreyas Pai, Tanmay Inamdar, and Sriram Pemmaraju