Treewidth, Kernels, and Algorithms

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen.Chapter &quote;Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds&quote; is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.