Classical complexity theory analyzes and classifies problems by the amount of a resource,
usually time or space, that is required by algorithms solving them. It was a fundamental idea …

We study the enumeration complexity of the natural extension of acyclic conjunctive queries
with disequalities. In this language, a number of NP-complete problems can be expressed …

We study the problem of deciding whether an n-variate polynomial, presented as an
arithmetic circuit G, contains a degree k square-free term with an odd coefficient. We show …

We develop new and improved randomized and deterministic algorithmic techniques for
path, matching, and packing problems. Our randomized algorithms are based on a new …

Color-coding is a technique to design fixed-parameter algorithms for several NP-complete
subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been …

The two objectives of this paper are:(1) to articulate three new general techniques for
designing FPT algorithms, and (2) to apply these to obtain new FPT algorithms for Set …

We propose a randomized divide-and-conquer technique that leads to improved
randomized and deterministic algorithms for NP-hard path, matching, and packing problems …

Parameterized Algorithmics: A Graph-Theoretic Approach Page 1 Parameterized Algorithmics:
A Graph-Theoretic Approach Henning Fernau Universität Tübingen, WSI für Informatik, Sand …

We introduce divide-and-color, a new technique for the solution of hard graph problems. It is
a combination of the well-known divide-and-conquer paradigm and color-coding [2]. Our …

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 …