An Overview of Techniques for Designing Parameterized Algorithms

Abstract

A survey of the most important and general techniques in parameterized algorithm design is given. Each technique is explained with a meta-algorithm, its use is illustrated by examples, and it is placed in a taxonomy under the four main headings of branching, kernelization, induction and win/win.