SWAT '88

SWAT '88
Author: Rolf Karlsson
Publisher: Springer Science & Business Media
Total Pages: 274
Release: 1988-06-22
Genre: Computers
ISBN: 9783540194873

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

SWAT 88

SWAT 88
Author: Rolf Karlsson
Publisher:
Total Pages: 262
Release: 1988
Genre:
ISBN:

SWAT 88

SWAT 88
Author: Rolf Karlsson
Publisher:
Total Pages: 262
Release: 1988
Genre:
ISBN:

Swat '88

Swat '88
Author: Rolf Karlsson
Publisher:
Total Pages: 272
Release: 2014-09-01
Genre:
ISBN: 9783662163252

SWAT ...

SWAT ...
Author:
Publisher:
Total Pages: 276
Release: 1988
Genre: Algorithms
ISBN:

Algorithms and Complexity

Algorithms and Complexity
Author: Bozzano G Luisa
Publisher: Elsevier
Total Pages: 1011
Release: 2014-06-28
Genre: Mathematics
ISBN: 0080933912

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

Treewidth, Kernels, and Algorithms

Treewidth, Kernels, and Algorithms
Author: Fedor V. Fomin
Publisher: Springer Nature
Total Pages: 350
Release: 2020-04-20
Genre: Computers
ISBN: 303042071X

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.