Fomin / Kratsch / van Leeuwen | Treewidth, Kernels, and Algorithms | E-Book | sack.de
E-Book

E-Book, Englisch, 299 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

Fomin / Kratsch / van Leeuwen Treewidth, Kernels, and Algorithms

Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
1. Auflage 2020
ISBN: 978-3-030-42071-0
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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

E-Book, Englisch, 299 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-030-42071-0
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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.
Fomin / Kratsch / van Leeuwen Treewidth, Kernels, and Algorithms jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Fomin, Fedor V.
Kratsch, Stefan
van Leeuwen, Erik Jan

Weitere Infos & Material

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.

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.