1 option
Treewidth, Kernels, and Algorithms : Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday / edited by Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12160
- Theoretical Computer Science and General Issues, 2512-2029 ; 12160
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer graphics.
- Artificial intelligence-Data processing.
- Computer science-Mathematics.
- Application software.
- Computer networks.
- Computer Graphics.
- Data Science.
- Mathematics of Computing.
- Computer and Information Systems Applications.
- Computer Communication Networks.
- Local Subjects:
- Algorithms.
- Computer Graphics.
- Data Science.
- Mathematics of Computing.
- Computer and Information Systems Applications.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (LV, 299 pages) : 48 illustrations, 23 illustrations in color.
- Edition:
- 1st edition 2020.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- 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. 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.
- Contents:
- Seeing Arboretum for the (partial k) Trees
- Collaborating With Hans: Some Remaining Wonderments
- Hans Bodlaender and the Theory of Kernelization Lower Bounds
- Algorithms, Complexity, and Hans
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Four shorts stories on surprising algorithmic uses of treewidth
- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices
- A Survey on Spanning Tree Congestion
- Surprising Applications of Treewidth Bounds for Planar Graphs
- Computing tree decompositions
- Experimental analysis of treewidth
- A Retrospective on (Meta) Kernelization
- Games, Puzzles and Treewidth
- Fast Algorithms for Join Operations on Tree Decompositions.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-42071-0
- 9783030420710
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.