1 066 kr
Skickas inom 7-10 vardagar
1 066 kr
Skickas inom 7-10 vardagar
1 074 kr
Läs direkt efter köp
1 067 kr
Läs direkt efter köp
Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
734 kr
Skickas inom 10-15 vardagar
917 kr
Läs direkt efter köp
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.
813 kr
Skickas inom 10-15 vardagar
839 kr
Läs direkt efter köp
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way.
The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presentscomplexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds.
All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
603 kr
Skickas inom 10-15 vardagar
13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings
1 093 kr
Skickas inom 10-15 vardagar
1 459 kr
Läs direkt efter köp
This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018.
The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.551 kr
Skickas inom 10-15 vardagar
734 kr
Läs direkt efter köp
565 kr
Skickas inom 10-15 vardagar
728 kr
Läs direkt efter köp
813 kr
Skickas inom 10-15 vardagar
718 kr
Läs direkt efter köp
549 kr
Skickas inom 10-15 vardagar
549 kr
Skickas inom 10-15 vardagar
710 kr
Läs direkt efter köp
549 kr
Skickas inom 10-15 vardagar
734 kr
Läs direkt efter köp
567 kr
Skickas inom 10-15 vardagar
734 kr
Läs direkt efter köp
567 kr
Skickas inom 10-15 vardagar
718 kr
Läs direkt efter köp
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part I
832 kr
Skickas inom 7-10 vardagar
1 059 kr
Läs direkt efter köp
31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II
836 kr
Skickas inom 10-15 vardagar
1 026 kr
Läs direkt efter köp