The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of
attention, particularly with the focus of producing algorithms with stronger theoretical …

Important variants of theVERTEX COVER problem (among others, CONNECTED VERTEX
COVER, CAPACITATED VERTEX COVER, and MAXIMUM PARTIAL VERTEX COVER) …

Crown structures in a graph are defined and shown to be useful in kernelization algorithms
for the classic vertex cover problem. Two vertex cover kernelization methods are discussed …

FPT is P-Time Extremal Structure I Page 1 FPT is P-Time Extremal Structure I VLADIMIR
ESTIVILL-CASTRO 1 , MICHAEL FELLOWS 2 , MICHAEL LANGSTON 3 , FRANCES …

We present a new method of solving graph problems related to Vertex Cover by
enumerating and expanding appropriate sets of nodes. As an application, we obtain …

We examine the parameterized complexity of t-Dominating Set, the problem of finding a set
of at most k nodes that dominate at least t nodes of a graph G=(V, E). The classic NP …

We introduce an NP-complete special case of the Weighted Set Cover problem and show its
fixed-parameter tractability with respect to the maximum subset size, a parameter that …

We study the well-known Vertex Cover problem parameterized above and below tight
bounds. We show that two of the parameterizations (both were suggested by Mahajan et al …

Tools of molecular biology and the evolving tools of genomics can now be exploited to study
the genetic regulatory mechanisms that control cellular responses to a wide variety of …

We propose a proof-theoretic approach for gaining evidence that certain parameterized
problems are not fixed-parameter tractable. We consider proofs that witness that a given …