Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.

This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared...

The Third International Workshop on Parameterized and Exact Computation washeldinVictoria, B. C. duringMay14-16,2008. Theworkshopwasco-located with the 40th ACM Symposium on Theory of Computing, which took place in Victoria during May 17-20. Previousmeetings of the IWPECseries wereheld in Bergen, Norway 2004 and Zu ]rich, Switzerland 2006, both as part of the ALGO joint conference. TheInternationalWorkshoponParameterizedandExactComputationcovers research in all aspects of parameterized and exact computation and complexity, including but not limited to: new techniques for the design and...

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.