4 citations · 16 across the 17 of their papers we have counts for
7 papers · 1 filter
Parameterized Geometric Graph Modification with Disk Scaling
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph and an integer $k\in\mathb…
Kernelization for Spreading Points
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance,…
Coresets for Clustering in Geometric Intersection Graphs
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar
Designing coresets--small-space sketches of the data preserving cost of the solutions within -approximate factor--is an important research direction in the study of cente…
(Re)packing Equal Disks into Rectangle
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without ov…
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…
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…
On Metric Multi-Covering Problems
Santanu Bhowmick, Tanmay Inamdar, Kasturi Varadarajan
In the metric multi-cover problem (MMC), we are given two point sets (servers) and (clients) in an arbitrary metric space , a positive integer that repre…