| Description |
1 online resource (lv, 299 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 12160 |
|
LNCS sublibrary, SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 12160.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Seeing Arboretum for the (partial k) Trees / Stefan Arnborg, Andrzej Proskurowski-- Collaborating With Hans: Some Remaining Wonderments / Michael R. Fellows, Frances A. Rosamond -- Hans Bodlaender and the Theory of Kernelization Lower Bounds / Danny Hermelin-- Algorithms, Complexity, and Hans / Jan van Leeuwen-- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs / Mark de Berg, Sándor Kisfaludi-Bak -- As Time Goes By: Reflections on Treewidth for Temporal Graphs / Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche -- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs / Alexander Grigoriev -- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds / Bart M. P. Jansen -- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths / Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi -- Four shorts stories on surprising algorithmic uses of treewidth / Dániel Marx -- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices / Jesper Nederlof -- A Survey on Spanning Tree Congestion / Yota Otachi -- Surprising Applications of Treewidth Bounds for Planar Graphs / Marcin Pilipczuk -- Computing tree decompositions / Michał Pilipczuk -- Experimental analysis of treewidth / Hisao Tamaki -- A Retrospective on (Meta) Kernelization / Dimitrios M. Thilikos -- Games, Puzzles and Treewidth / Tom C. van der Zanden -- Fast Algorithms for Join Operations on Tree Decompositions / Johan M. M. van Rooij |
| Summary |
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 |
| Notes |
Online resource; title from PDF title page (SpringerLink, viewed April 20, 2020) |
| Subject |
Kernel functions.
|
|
Algorithms.
|
|
Algorithms
|
|
algorithms.
|
|
Algorithms
|
|
Kernel functions
|
| Genre/Form |
Festschriften
|
|
Festschriften.
|
| Form |
Electronic book
|
| Author |
Bodlaender, H. L., honouree.
|
|
Fomin, Fedor V., editor.
|
|
Kratsch, Stefan, editor
|
|
Leeuwen, Erik Jan van, 1981- editor.
|
| ISBN |
9783030420710 |
|
303042071X |
|
