“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)