2 citations · 4 across the 6 of their papers we have counts for
6 papers
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
Matthias Bentert, Fedor V. Fomin, Tanmay Inamdar +1
In this paper, we begin the exploration of vertex-ordering problems through the lens of exponential-time approximation algorithms. In particular, we ask the following question: Can…
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…
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…
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…
Exact Exponential Algorithms for Clustering Problems
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
In this paper we initiate a systematic study of exact algorithms for well-known clustering problems, namely -Median and -Means. In -Median, the input consists of a set …