1: Phase Synchronization in Railway Timetables
2: L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry
3: A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
4: Graph Iterators: Decoupling Graph Structures from Algorithms
5: A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
6: Approximation Algorithms for Campaign Management
7: Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge decomposition
8: Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem