Treewidth, Kernels, and Algorithms

Fedor V. Fomin

ISBN 10: 3030420701 / ISBN 13: 9783030420703

Published by Springer, Springer Mär 2020, 2020

About this Item

This item is printed on demand - Print on Demand Titel. Neuware Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 360 pp. Englisch.

Seller Inventory # 9783030420703

Bibliographic Details

• Title: Treewidth, Kernels, and Algorithms
• Publisher: Springer, Springer Mär 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 3030420701
• ISBN 13: 9783030420703
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 20D millimeters 235 millimeters width by 155 millimeters height by 20 millimeters depth
• Weight: 546 grams

About this title

Synopsis

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.