What do you think?
Rate this book
Parameterized Algorithms
Introduction.- Kernelization.- Bounded Search Trees.- Iterative Compression.- Randomized Methods in Parameterized Algorithms.- Miscellaneous.- Treewidth.- Finding Cuts and Separators.- Advanced Kernelization Algorithms.- Algebraic Sieves, Convolutions, and Polynomials.- Improving Dynamic Programming on Tree Decompositions.- Matroids.- Fixed-Parameter Intractability.- Lower Bounds Based on the Exponential-Time Hypothesis.- Lower Bounds for Kernelization.
632 pages, Paperback
First published August 3, 2015
1 person is currently reading
14 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 2 of 2 reviews
April 28, 2024
I read this book multiple times, once while I was a PhD student, once designing the "Advanced Algorithms Design" course for graduate students, and once when auditing the course by Professor Daniel Marx (one of the co-authors) at https://cms.cispa.saarland/paramalg/
This book, with the CLRS's algorithms book, is almost always with me when I am struggling to solve theoretical CS hard problems!
This book, with the CLRS's algorithms book, is almost always with me when I am struggling to solve theoretical CS hard problems!
June 11, 2024
Nice read. A couple sections kinda drown you with over description but overall an enjoyable and educational coverage of the ideas :)
Displaying 1 - 2 of 2 reviews