This book constitutes the refereed proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004, held in Humlebaek, Denmark in July 2004. The 40 revised full papers presented together with an invited paper and the abstract of an invited talk were carefully reviewed and selected from 121 submissions. The papers span the entire range of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, bioinformatics, combinatorics, sorting, searching, online algorithms, optimization, etc.

This book constitutes the refereed proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008, held in Gothenborg, Sweden, in July 2008. The 36 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 111 submissions. Papers were solicited for original research on algorithms and data structures in all areas, including but not limited to: approximation algorithms, computational biology, computational geometry, distributed algorithms, external-memory algorithms, graph algorithms, online algorithms, optimization algorithms, parallel algorithms, randomized algorithms, string algorithms and algorithmic game theory.

This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in Lübeck, Germany in August 2005. The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004. The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition-over 400 pages longer than its prede

Here are the refereed proceedings of the Second International Workshop on Parameterized and Exact Computation, IWPEC 2006, held in the context of the combined conference ALGO 2006. The book presents 23 revised full papers together with 2 invited lectures. Coverage includes research in all aspects of parameterized and exact computation and complexity, including new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, and more.

This book studies exponential time algorithms for NP-hard problems. In this modern area, the aim is to design algorithms for combinatorially hard problems that execute provably faster than a brute-force enumeration of all candidate solutions. After an introduction and survey of the field, the text focuses first on the design and especially the analysis of branching algorithms. The analysis of these algorithms heavily relies on measures of the instances, which aim at capturing the structure of the instances, not merely their size. This makes them more appropriate to quantify the progress an algorithm makes in the process of solving a problem. Expanding the methodology to design exponential time algorithms, new techniques are then presented. Two of them combine treewidth based algorithms with branching or enumeration algorithms. Another one is the iterative compression technique, prominent in the design of parameterized algorithms, and adapted here to the design of exponential time algorithms. This book assumes basic knowledge of algorithms and should serve anyone interested in exactly solving hard problems.