4 citations · 16 across the 17 of their papers we have counts for
10 papers · 1 filter
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as paramete…
Diamond on ladder systems and countably metacompact topological spaces
Rodrigo Carvalho, Tanmay Inamdar, Assaf Rinot
The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again…
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
Walter Didimo, Fedor V. Fomin, Petr A. Golovach +3
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all…
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +1
We study the \textsc{-Fixed Cardinality Graph Partitioning (-FCGP)} problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In…
Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability
Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh +1
In the Minimum Bisection problem, input is a graph and the goal is to partition the vertex set into two parts and , such that and the number of edg…
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,…
Fixed-Parameter Algorithms for Fair Hitting Set Problems
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic algorithmic study of…
FPT Approximations for Capacitated/Fair Clustering with Outliers
Rajni Dabas, Neelima Gupta, Tanmay Inamdar
Clustering problems such as -Median, and -Means, are motivated from applications such as location planning, unsupervised learning among others. In such applications, it is im…
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…
Proportionally Fair Matching with Multiple Groups
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar +1
The study of fair algorithms has become mainstream in machine learning and artificial intelligence due to its increasing demand in dealing with biases and discrimination. Along thi…