30 citations · 157 across the 83 of their papers we have counts for
3 papers · 2 filters
Data-compression for Parametrized Counting Problems on Sparse graphs
Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos
We study the concept of \emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function and a pa…
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some prop…
Clustering to Given Connectivities
Petr A. Golovach, Dimitrios M. Thilikos
We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In {\sc Clustering to Given Connectivities}, we…