Sale!

Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st edition by Fedor Fomin, Stefan Kratsch, Erik Jan van Leeuwen ISBN 9783030420703

Original price was: $70.00.Current price is: $24.99.

Instant download Treewidth Kernels and Algorithms Fedor V. Fomin & Stefan Krno & Wen Gao & Bernhard Steffen & Gerhard Woeginger & Moti Yung after payment

SKU: EB_90634 Category:

Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st edition by Fedor Fomin, Stefan Kratsch, Erik Jan van Leeuwen – Ebook PDF Instant Download/Delivery: 9783030420703
Full dowload Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st edition  after payment

Product details:

ISBN 13: 9783030420703
Author: Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen 

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.

Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st Table of contents:

Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st Table of Contents

Seeing Arboretum for the (partial k) Trees.

  1.  Collaborating With Hans: Some Remaining Wonderments.
  2.  Hans Bodlaender and the Theory of Kernelization Lower Bounds.
  3.  Algorithms, Complexity, and Hans.
  4.  Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs.
  5.  As Time Goes By: Reflections on Treewidth for Temporal Graphs
  6.  Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs.
  7.  Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds.
  8.  Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths.
  9.  Four shorts stories on surprising algorithmic uses of treewidth.- Algorithms for NP-Hard Problems via Rank-related Parameters of Matrices.
  10.  A Survey on Spanning Tree Congestion.
  11.  Surprising Applications of Treewidth Bounds for Planar Graphs.
  12.  Computing tree decompositions.
  13.  Experimental analysis of treewidth.
  14.  A Retrospective on (Meta) Kernelization.
  15.  Games, Puzzles and Treewidth.
  16.  Fast Algorithms for Join Operations on Tree Decompositions.

People also search for Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st:

tree generation algorithm
    
tree reduction algorithm
    
tree partitioning algorithm
    
algorithms on trees and graphs pdf

Reviews

There are no reviews yet.

Be the first to review “Treewidth, Kernels, and Algorithms Essays Dedicated to Hans Bodlaender on the Occasion of His 60th Birthday 1st edition by Fedor Fomin, Stefan Kratsch, Erik Jan van Leeuwen ISBN 9783030420703”