Tanmay Inamdar

Orcid: 0000-0002-0184-5932

Affiliations:
  • Indian Institute of Technology Jodhpur, Jodhpur, India
  • University of Bergen, Norway (former)
  • University of Iowa, Iowa City, IA, USA (PhD 2020)


According to our database1, Tanmay Inamdar authored at least 35 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FPT approximation and subexponential algorithms for covering few or many edges.
Inf. Process. Lett., March, 2024

Controlling Delegations in Liquid Democracy.
CoRR, 2024

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

Exponential-Time Approximation Schemes via Compression.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Clustering what Matters: Optimal Approximation for Clustering with Outliers.
J. Artif. Intell. Res., 2023

FPT Approximations for Capacitated/Fair Clustering with Outliers.
CoRR, 2023

Proportionally Fair Matching with Multiple Groups.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Socially Fair Matching: Exact and Approximation Algorithms.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.
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.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Kernelization for Spreading Points.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability).
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Coresets for Clustering in Geometric Intersection Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks.
Theory Comput., 2022

Near-optimal clustering in the <i>k</i>-machine model.
Theor. Comput. Sci., 2022

Algorithms for covering multiple submodular constraints and applications.
J. Comb. Optim., 2022

(Re)packing Equal Disks into Rectangle.
CoRR, 2022

Non-Uniform k-Center and Greedy Clustering.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Exact Exponential Algorithms for Clustering Problems.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

(Re)packing Equal Disks into Rectangle.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Fault-Tolerant Covering Problems in Metric Spaces.
Algorithmica, 2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Capacitated Covering Problems in Geometric Spaces.
Discret. Comput. Geom., 2020

Capacitated Sum-Of-Radii Clustering: An FPT Approximation.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks.
CoRR, 2019

Fault Tolerant Clustering with Outliers.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

A Constant Approximation for Colorful k-Center.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Local Search for Geometric Partial Covering Problems.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
On the Partition Set Cover Problem.
CoRR, 2018

Large-Scale Distributed Algorithms for Facility Location with Outliers.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Near-Optimal Clustering in the k-machine model.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

On Partial Covering For Geometric Set Systems.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

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

2016
Improved Approximation for Metric Multi-Cover.
CoRR, 2016


  Loading...