Tanmay Inamdar

According to our database, Tanmay Inamdar authored at least 38 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

(Re)packing Equal Disks into Rectangle.

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

Discret. Comput. Geom., December, 2024

FPT approximation and subexponential algorithms for covering few or many edges.

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana

Inf. Process. Lett., March, 2024

Exponential-Time Approximation Schemes via Compression.

Tanmay Inamdar, Madhumita Kundu, Pekka Parviainen, M. S. Ramanujan, Saket Saurabh

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.

Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Cuts in Graphs with Matroid Constraints.

Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Controlling Delegations in Liquid Democracy.

Shiri Alouf-Heffetz, Tanmay Inamdar, Pallavi Jain, Nimrod Talmon, Yash More Hiren

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Hybrid k-Clustering: Blending k-Median and k-Center.

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

Proceedings of the Approximation, 2024

2023

Clustering what Matters: Optimal Approximation for Clustering with Outliers.

Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue

J. Artif. Intell. Res., 2023

FPT Approximations for Capacitated/Fair Clustering with Outliers.

Rajni Dabas, Neelima Gupta, Tanmay Inamdar

CoRR, 2023

Proportionally Fair Matching with Multiple Groups.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Socially Fair Matching: Exact and Approximation Algorithms.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.

Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Kernelization for Spreading Points.

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

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).

Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Coresets for Clustering in Geometric Intersection Graphs.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks.

Chandra Chekuri, Tanmay Inamdar

Adv. Math. Commun., 2022

Near-optimal clustering in the <i>k</i>-machine model.

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

Theor. Comput. Sci., 2022

Algorithms for covering multiple submodular constraints and applications.

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

J. Comb. Optim., 2022

Non-Uniform k-Center and Greedy Clustering.

Tanmay Inamdar, Kasturi R. Varadarajan

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Exact Exponential Algorithms for Clustering Problems.

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

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

(Re)packing Equal Disks into Rectangle.

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

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Fault-Tolerant Covering Problems in Metric Spaces.

Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan

Algorithmica, 2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.

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

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Capacitated Covering Problems in Geometric Spaces.

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

Discret. Comput. Geom., 2020

Capacitated Sum-Of-Radii Clustering: An FPT Approximation.

Tanmay Inamdar, Kasturi R. Varadarajan

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks.

Chandra Chekuri, Tanmay Inamdar

CoRR, 2019

Fault Tolerant Clustering with Outliers.

Tanmay Inamdar, Kasturi R. Varadarajan

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

A Constant Approximation for Colorful k-Center.

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

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Local Search for Geometric Partial Covering Problems.

Tanmay Inamdar

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

On the Partition Set Cover Problem.

Tanmay Inamdar, Kasturi R. Varadarajan

CoRR, 2018

Large-Scale Distributed Algorithms for Facility Location with Outliers.

Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Near-Optimal Clustering in the k-machine model.

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

Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

On Partial Covering For Geometric Set Systems.

Tanmay Inamdar, Kasturi R. Varadarajan

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces.

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

CoRR, 2017

2016

Improved Approximation for Metric Multi-Cover.

Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan

CoRR, 2016