• Publications
  • Influence
Parameterized Algorithms
TLDR
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. Expand
  • 933
  • 71
  • PDF
Known algorithms on graphs of bounded treewidth are probably optimal
TLDR
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. Expand
  • 171
  • 20
  • PDF
Lower bounds based on the Exponential Time Hypothesis
TLDR
The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). Expand
  • 288
  • 19
  • PDF
(Meta) Kernelization
TLDR
We show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness condition admit a polynomial kernel on graphs of bounded genus. Expand
  • 249
  • 19
  • PDF
Fast FAST
TLDR
We present a randomized subexponential time, polynomial space parameterized algorithm for the k -Weighted Feedback Arc Set in Tournaments (k -FAST ) problem. Expand
  • 89
  • 17
  • PDF
On Problems as Hard as CNF-SAT
TLDR
The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. Expand
  • 132
  • 15
  • PDF
Incompressibility through Colors and IDs
TLDR
In parameterized complexity each problem instance comes with a parameter k , and a parameterized problem is said to admit a kernel if there are polynomial time preprocessing rules that reduce the input instance to an instance with size k . Expand
  • 191
  • 14
  • PDF
Slightly superexponential parameterized problems
TLDR
A central problem in parameterized algorithms is to obtain algorithms with running time <i>f</i>(<i>k</i>) such that the dependence on the parameter is as slow growing function of the parameter as possible. Expand
  • 124
  • 13
  • PDF
Treewidth governs the complexity of target set selection
TLDR
We present an algorithm for Target Set Selection running in n^O^(^w^) time, for graphs with n vertices and treewidth bounded by w. Expand
  • 96
  • 12
  • PDF
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
TLDR
We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. Expand
  • 106
  • 11
  • PDF