1 citations · 2 across the 5 of their papers we have counts for
8 papers
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
In Clique Cover, given a graph and an integer , the task is to partition the vertices of into cliques. Clique Cover on unit ball graphs has a natural interpretation…
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…
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 …
How to Find a Good Explanation for Clustering?
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +3
-means and -median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependences on all the features, it is challenging to interpr…
FPT Approximation for Fair Minimum-Load Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +2
In this paper, we consider the Minimum-Load -Clustering/Facility Location (MLkC) problem where we are given a set of points in a metric space that we have to cluster and…
Lossy Kernelization of Same-Size Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +2
In this work, we study the -median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main res…
Parameterized Complexity of Categorical Clustering with Size Constraints
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\ldots,a_n} over Σ^m, where Σis a finite alphabet, and integers k and B. The task is to partiti…
Metric Dimension Parameterized by Treewidth
Édouard Bonnet, Nidhi Purohit
A resolving set of a graph is a subset of its vertices such that no two vertices of have the same distance vector to . The Metric Dimension problem asks for a resolv…