6 citations · 14 across the 31 of their papers we have counts for
6 papers · 1 filter
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan +1
In a reconfiguration version of an optimization problem the input is an instance of and two feasible solutions and . The objective is to determin…
Refined Complexity of PCA with Outliers
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan +1
Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance an…
Low-rank binary matrix approximation in column-sum norm
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan +1
We consider -Rank- Approximation over GF(2), where for a binary matrix and a positive integer , one seeks a binary matrix of rank at m…
Hitting Topological Minors is FPT
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan +2
In the Topological Minor Deletion (TM-Deletion) problem input consists of an undirected graph , a family of undirected graphs and an integer . The task is to deter…
Decomposition of Map Graphs with Applications
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan +2
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behin…
Going Far From Degeneracy
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov +3
An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erdős and Gallai from 1959, every graph of degeneracy d>1…