KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Treewidth, Kernels, and Algorithms
  • Produktbild: Treewidth, Kernels, and Algorithms
Band 12160

Treewidth, Kernels, and Algorithms Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday

Aus der Reihe Theoretical Computer Science and General Issues

64,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

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...

Beschreibung

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.

Produktdetails

Einband

Taschenbuch
Erscheinungsdatum

17.03.2020
Abbildungen

LV, 299 p. 48 illus., 23 illus. in color.
Herausgeber Fedor V. Fomin + weitere

Produktdetails

Einband

Taschenbuch
Erscheinungsdatum

17.03.2020
Abbildungen

LV, 299 p. 48 illus., 23 illus. in color.
Herausgeber
Verlag Springer
Seitenzahl

299
Maße (L/B/H)

23,5/15,5/2 cm
Gewicht

546 g
Auflage

1st ed. 2020
Sprache

Englisch
ISBN

978-3-030-42070-3
Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Treewidth, Kernels, and Algorithms
  • Produktbild: Treewidth, Kernels, and Algorithms

  • 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.