Fr. 89.00

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

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

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.

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

Product details

Assisted by Fedor V. Fomin (Editor), Erik Jan van Leeuwen (Editor), Stefa Kratsch (Editor), Stefan Kratsch (Editor), Erik Jan van Leeuwen (Editor), Erik Jan van Leeuwen (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 01.03.2020
 
EAN 9783030420703
ISBN 978-3-0-3042070-3
No. of pages 299
Dimensions 160 mm x 20 mm x 237 mm
Weight 545 g
Illustrations LV, 299 p. 48 illus., 23 illus. in color.
Series Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Subject Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.