Treewidth, Kernels, and Algorithms

Treewidth, Kernels, and Algorithms
Author :
Publisher : Springer Nature
Total Pages : 350
Release :
ISBN-10 : 9783030420710
ISBN-13 : 303042071X
Rating : 4/5 (71X Downloads)

Book Synopsis Treewidth, Kernels, and Algorithms by : Fedor V. Fomin

Download or read book Treewidth, Kernels, and Algorithms written by Fedor V. Fomin and published by Springer Nature. This book was released on 2020-04-20 with total page 350 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Treewidth, Kernels, and Algorithms Related Books

Treewidth, Kernels, and Algorithms
Language: en
Pages: 350
Authors: Fedor V. Fomin
Categories: Computers
Type: BOOK - Published: 2020-04-20 - Publisher: Springer Nature

GET EBOOK

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 volum
Algorithms - ESA 2009
Language: en
Pages: 807
Authors: Amos Fiat
Categories: Computers
Type: BOOK - Published: 2009-09-03 - Publisher: Springer Science & Business Media

GET EBOOK

This book constitutes the refereed proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009, held in Copenhagen, Denmark, in September 2009 in
Exact Exponential Algorithms
Language: en
Pages: 208
Authors: Fedor V. Fomin
Categories: Mathematics
Type: BOOK - Published: 2010-10-26 - Publisher: Springer Science & Business Media

GET EBOOK

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial ti
Algorithms and Computation
Language: en
Pages: 791
Authors: Takao Asano
Categories: Computers
Type: BOOK - Published: 2011-11-21 - Publisher: Springer Science & Business Media

GET EBOOK

This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in Decembe
Algorithms and Data Structures
Language: en
Pages: 730
Authors: Frank Dehne
Categories: Computers
Type: BOOK - Published: 2011-07-18 - Publisher: Springer

GET EBOOK

This book constitutes the refereed proceedings of the 12th Algorithms and Data Structures Symposium, WADS 2011, held in New York, NY, USA, in August 2011. The A