Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

Let M=(E, I) be a matroid and let S={S 1, ċ, S t} be a family of subsets of E of size p. A
subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …

For the vast majority of local problems on graphs of small tree width (where by local we
mean that a solution can be verified by checking separately the neighbourhood of each …

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can
be solved in time 2 O (tw)| V| O (1) for graphs G=(V, E) with a given tree decomposition of …

We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

For a pattern graph H on k nodes, we consider the problems of finding and counting the
number of (not necessarily induced) copies of H in a given large graph G on n nodes, as …

ACM: Digital Library: Communications of the ACM ACM Digital Library Communications of the
ACM Volume 59, Number 1 (2016), Pages 98-105 Algebraic fingerprints for faster algorithms …

We present parameterized algorithms for the k-path problem, the p-packing of q-sets
problem, and the q-dimensional p-matching problem. Our algorithms solve these problems …

Abstract Let M=(E, I) be a matroid and let S={S 1,…, St} be a family of subsets of E of size p.
A subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …