Overview
- Presents an accessible overview of the state of the art of multivariate algorithmics and complexity
- Describes the wealth of recent techniques for proving parameterized tractability
- Showcases the powerful new lower bound techniques
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Computer Science (TCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
Table of contents (35 chapters)
-
Parameterized Tractability
-
Elementary Positive Techniques
Reviews
“It is a new book that conveys a detailed picture of parameterized complexity as it stands today. … The writing style is direct and engaging, allowing the reader to quickly grasp the core ideas for each topic. The book coverage is comprehensive, including even relatively recent results, and manages to give a rich representation of the current state of the field. In short, this is an excellent book that will serve well anyone interested in algorithm design and complexity.” (Marius Zimand, zbMATH 1358.68006, 2017)
“It can be read by graduate students who have some background in computational complexity. … I strongly recommend Fundamentals of Parameterized Complexity for all researchers in theoretical computer science. … It is my belief that this book is now the definitive text on parameterized complexity, both for the breadthand depth of material covered and also for including the latest developments in the field (as recently as 2012).” (Rajesh Chitnis, SIGACT News, Vol. 46 (1), 2015)
“This book is currently the only monograph that covers lower bounds in kernelization or parameterized approximation. … this new volume could serve as a (relatively easily) accessible source for a researcher in the area as well as helping students find their way into this interesting field. … nearly 700 citations and a well-designed index help to navigate through the book and through the literature.” (Henning Fernau, Mathematical Reviews, November, 2014)Authors and Affiliations
About the authors
Dr. Rodney G. Downey is a Professor in the School of Mathematics, Statistics and Operations Research, at the Victoria University of Wellington, New Zealand.
Dr. Michael R. Fellows is a Professor in the School of Engineering and Information Technology, at the Charles Darwin University, Darwin, NT, Australia.
Bibliographic Information
Book Title: Fundamentals of Parameterized Complexity
Authors: Rodney G. Downey, Michael R. Fellows
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-1-4471-5559-1
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London 2013
Hardcover ISBN: 978-1-4471-5558-4Published: 17 December 2013
Softcover ISBN: 978-1-4471-7164-5Published: 27 August 2016
eBook ISBN: 978-1-4471-5559-1Published: 03 December 2013
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 1
Number of Pages: XXX, 763
Number of Illustrations: 83 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Mathematics of Algorithmic Complexity