1: I/O Efficient Algorithms for Matrix Computations
2: Using Strategy Improvement to Stay Alive
3: Local Strategy Improvement for Parity Game Solving
4: Algebraic characterisation of one-way patterns
5: Smoothed Analysis of Balancing Networks
6: Cloning Voronoi Diagrams via Retroactive Data Structures
7: Parallel Approximation Algorithms for Facility-Location Problems
8: Minimizing a sum of submodular functions
9: Geodesic diameter of a polygonal domain in O(n^4 log n) time
10: The Complexity Of The NP-Class
11: On well-separated sets and fast multipole methods
12: Exploring the randomness of Directed Acyclic Networks
13: Constructions from Dots and Lines
14: Does Treewidth Help in Modal Satisfiability?