ISBN: 9783030420710
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 transformat… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783030420710
Treewidth Kernels and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday: ab 60.99 € eBooks > Sachthemen & Ratgeber > Computer & Internet Springer-Ve… Mehr…
eBook.de Versandkosten:in stock, , , DE. (EUR 0.00) Details... |
ISBN: 9783030420710
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 transformat… Mehr…
ISBN: 9783030420710
Treewidth Kernels and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday: ab 60.99 € eBooks > Sachthemen & Ratgeber > Computer & Internet Springer-Ve… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Treewidth, Kernels, and Algorithms
EAN (ISBN-13): 9783030420710
Herausgeber: Springer Shop
Buch in der Datenbank seit 2021-04-27T13:48:10+02:00 (Berlin)
Detailseite zuletzt geändert am 2022-09-26T10:45:36+02:00 (Berlin)
ISBN/EAN: 9783030420710
ISBN - alternative Schreibweisen:
978-3-030-42071-0
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: van leeuwen
Daten vom Verlag:
Autor/in: Fedor V. Fomin; Stefan Kratsch; Erik Jan van Leeuwen
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
Verlag: Springer; Springer International Publishing
299 Seiten
Erscheinungsjahr: 2020-04-20
Cham; CH
Sprache: Englisch
69,54 € (DE)
71,50 € (AT)
77,00 CHF (CH)
Available
LV, 299 p. 48 illus., 23 illus. in color.
EA; E107; eBook; Nonbooks, PBS / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; 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; C; Algorithms; Computer Graphics; Data Science; Mathematics of Computing; Computer and Information Systems Applications; Computer Communication Networks; Computer Science; Grafikprogrammierung; Datenbanken; Mathematik für Informatiker; Angewandte Informatik; Netzwerk-Hardware; BC
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.
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.
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.
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
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783030420703 Treewidth Kernels and Algorithms (Fedor V. Fomin; Stefan Kratsch; Erik Jan van Leeuwen)
< zum Archiv...