Overview
- Contains refereed papers dedicated to Hans L. Bodlaender and to his work
- Collects a number of papers by Hans' collaborators over the years presenting a broad range of topics reflecting Hans’ versatility
- Depicts Hans L. Bodlaender’s major contributions to algorithms research, complexity theory, and graph theory
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12160)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
- approximation algorithms
- approximation theory
- artificial intelligence
- bounded treewidth
- computer networks
- computer systems
- directed graphs
- engineering
- graph class
- graph g
- graph theory
- graphic methods
- mathematics
- network protocols
- planar graph
- polynomial approximation
- polynomial-time algorithms
- signal processing
- theoretical computer science
- algorithm analysis and problem complexity
- data structures
Table of contents (19 chapters)
-
Front Matter
-
Surveys
-
Front Matter
-
Editors and Affiliations
Bibliographic Information
Book Title: Treewidth, Kernels, and Algorithms
Book Subtitle: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
Editors: Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-42071-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2020
Softcover ISBN: 978-3-030-42070-3Published: 17 March 2020
eBook ISBN: 978-3-030-42071-0Published: 20 April 2020
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: LV, 299
Number of Illustrations: 25 b/w illustrations, 23 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Computer Graphics, Data Structures, Mathematics of Computing, Information Systems Applications (incl. Internet), Computer Communication Networks