Treewidth, Kernels, and Algorithms Treewidth, Kernels, and Algorithms

Treewidth, Kernels, and Algorithms

Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday

Fedor V. Fomin and Others
    • 54,99 €
    • 54,99 €

Publisher Description

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.

GENRE
Computing & Internet
RELEASED
2020
20 April
LANGUAGE
EN
English
LENGTH
354
Pages
PUBLISHER
Springer International Publishing
PROVIDER INFO
Springer Science & Business Media LLC
SIZE
15.5
MB
Computing and Combinatorics Computing and Combinatorics
2025
Computing and Combinatorics Computing and Combinatorics
2025
Computer Science – Theory and Applications Computer Science – Theory and Applications
2018
Exact Exponential Algorithms Exact Exponential Algorithms
2010
Parameterized and Exact Computation Parameterized and Exact Computation
2010