3 citations · 4 across the 4 of their papers we have counts for
8 papers
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +1
De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dyn…
Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks
Chandra Chekuri, Tanmay Inamdar
Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 200…
A Constant Approximation for Colorful k-Center
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai +1
In this paper, we consider the colorful -center problem, which is a generalization of the well-known -center problem. Here, we are given red and blue points in a metric space…
Large-Scale Distributed Algorithms for Facility Location with Outliers
Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju
This paper presents fast, distributed, -approximation algorithms for metric facility location problems with outliers in the Congested Clique model, Massively Parallel Computa…
On the Partition Set Cover Problem
Tanmay Inamdar, Kasturi Varadarajan
Several algorithms with an approximation guarantee of are known for the Set Cover problem, where is the number of elements. We study a generalization of the Set Cov…
On Partial Covering For Geometric Set Systems
Tanmay Inamdar, Kasturi Varadarajan
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \math…