Open AccessBook
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Jörg Flum,Martin Grohe +1 more
About:
The article was published on 2006-02-09 and is currently open access. It has received 1525 citations till now. The article focuses on the topics: Parameterized complexity & Series (mathematics).read more
Citations
More filters
Journal ArticleDOI
On problems without polynomial kernels
TL;DR: Using the notion of distillation algorithms, a generic lower-bound engine is developed that allows showing that a variety of FPT problems, fulfilling certain criteria, cannot have polynomial kernels unless the polynomially-bounded hierarchy collapses.
Journal ArticleDOI
Book review: Invitation to fixed-parameter algorithms
TL;DR: This is a review of the recent book by Rolf Niedermeier on fixed-parameter algorithms that contains a critical description of the covered material, a comparison with other books dedicated to the same field and an evaluation of its contribution as a monograph to the theoretical computer science community.
Journal ArticleDOI
The complexity of homomorphism and constraint satisfaction problems seen from the other side
TL;DR: It is proved that, under some complexity theoretic assumption from parameterized complexity theory, HOM(C,−) is in polynomial time if and only if C has bounded tree width modulo homomorphic equivalence.
Book
Exact Exponential Algorithms
Fedor V. Fomin,Petteri Kaski +1 more
TL;DR: Discovering surprises in the face of intractability is found to be a challenge in finding solutions to intractable problems.
Journal ArticleDOI
Invitation to data reduction and problem kernelization
Jiong Guo,Rolf Niedermeier +1 more
TL;DR: A brief survey is presented that presents data reduction and problem kernelization as a promising research field for algorithm and complexity theory.