Treewidth, Kernels, and Algorithms

Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen, Sub Algorithms and Complexity, Algorithms and Complexity · Lecture notes in computer science · 2020

This Festschrift book is published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The contributions show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games.

Read the paper · More papers on PaperTik