Treewidth, Kernels, and Algorithms
- Fedor V. Fomin
- Stefan Kratsch
- Erik Jan van Leeuwen
Paperback & Hardcover deals ―
Amazon IndiaGOFlipkart GOSnapdealGOSapnaOnlineGOJain Book AgencyGOBooks Wagon₹4,484Book ChorGOCrosswordGODC BooksGOe-book & Audiobook deals ―
Amazon India GOGoogle Play Books ₹55.99Audible GO* Price may vary from time to time.
* GO = We're not able to fetch the price (please check manually visiting the website).
Know about the book -
Treewidth, Kernels, and Algorithms is written by Fedor V. Fomin and published by Springer Nature. It's available with International Standard Book Number or ISBN identification 303042071X (ISBN 10) and 9783030420710 (ISBN 13).
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 “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
