Introduction.- Kernelization.- Bounded Search Trees.- Iterative Compression.- Randomized Methods in Parameterized Algorithms.- Miscellaneous.- Treewidth.- Finding Cuts and Separators.- Advanced Kernelization Algorithms.- Algebraic Techniques: 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.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want