6 citations · 9 across the 8 of their papers we have counts for
23 papers
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh +2
We initiate a systematic study of approximation schemes for fundamental optimization problems on disk graphs, a common generalization of both planar graphs and unit-disk graphs. Ou…
Partial Vertex Cover on Graphs of Bounded Degeneracy
Fahad Panolan, Hannane Yaghoubizade
In the Partial Vertex Cover (PVC) problem, we are given an -vertex graph and a positive integer , and the objective is to find a vertex subset of size maximizing…
Gerrymandering on graphs: Computational complexity and parameterized algorithms
Sushmita Gupta, Pallavi Jain, Fahad Panolan +2
Partitioning a region into districts to favor a particular candidate or a party is commonly known as gerrymandering. In this paper, we investigate the gerrymandering problem in gra…
Diverse Collections in Matroids and Graphs
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan +2
We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from gra…
EPTAS for -means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach +3
We consider a generalization of the fundamental -means clustering for data with incomplete or corrupted entries. When data objects are represented by points in , a…
Improved FPT Algorithms for Deletion to Forest-like Structures
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan +2
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterized Complexity. In this problem, given an undirected graph and a non-negative…