This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication Parameterized Complexity by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
Format: Paperback
Pages: 508
Edition: Softcover reprint of hardcover 1st ed. 2006
Publisher: Springer
Published: 12 Feb 2010
ISBN 10: 3642067573
ISBN 13: 9783642067570
From the reviews:
The book is comprehensive and up-to-date. ... The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the implications of the results are spelled out clearly, the exercises are relevant. The book is recommended to specialists as a work of reference, as well as to beginners who want a solid introduction to the theory of parametrized computational problems. (Marius Zimand, Zentralblatt MATH, Vol. 1143, 2008)
FREE UK DELIVERY 
Global shipping from £2.99
FREE UK DELIVERY
30 Day Refund Guarantee
