Produktnummer:
188a634afa967c43e48802ad6efe72d1a7
Themengebiete: | approximation algorithms approximation theory artificial intelligence bounded treewidth computer networks computer systems directed graphs engineering graph class graph g |
---|---|
Veröffentlichungsdatum: | 17.03.2020 |
EAN: | 9783030420703 |
Sprache: | Englisch |
Seitenzahl: | 299 |
Produktart: | Kartoniert / Broschiert |
Herausgeber: | Fomin, Fedor V. Kratsch, Stefan van Leeuwen, Erik Jan |
Verlag: | Springer International Publishing |
Untertitel: | Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday |
Produktinformationen "Treewidth, Kernels, and Algorithms"
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.

Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen