Treewidth, Kernels, and Algorithms

Explore the fascinating world of graph algorithms with Treewidth, Kernels, and Algorithms by Fedor V. Fomin. Published by Springer Nature Switzerland AG in 2020, this first edition spans 299 pages and serves as a Festschrift honoring the esteemed Hans L. advisor, Jan van Leeuwen. The book delves into key concepts such as treewidth and kernels, offering valuable insights into their applications in algorithm design and analysis. One of the standout chapters, “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds,” is available as open access under a Creative Commons Attribution 4.0 International License, providing readers with an opportunity to engage with cutting-edge research. Perfect for scholars and enthusiasts alike, this book is a must-have addition to your collection if you are passionate about theoretical computer science and graph theory.