25 citations · 109 across the 80 of their papers we have counts for
7 papers · 2 filters
Finding irrelevant vertices in linear time on bounded-genus graphs
Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis +1
The irrelevant vertex technique provides a powerful tool for the design of parameterized algorithms for a wide variety of problems on graphs. A common characteristic of these probl…
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos
For a finite collection of graphs , the \textsc{-TM-Deletion} problem has as input an -vertex graph and an integer and asks whether there exists a se…
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…
Parameterized k-Clustering: The distance matters!
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
We consider the -Clustering problem, which is for a given multiset of vectors and a nonnegative number , to decide whether can be partitioned…
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov +2
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a…