An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of param

This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized comple

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained g

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly

Provides an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.