1: Acyclic, Star, and Injective Colouring: Bounding the Diameter
2: On the rank of Z_2-matrices with free entries on the diagonal
3: HINT: A Hierarchical Index for Intervals in Main Memory
4: Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
5: Efficiency and Stability in Euclidean Network Design
6: The Metric Relaxation for $0$-Extension Admits an $\Omega(\log^{2/3}{k})$ Gap
7: Efficient Binary Decision Diagram Manipulation in External Memory
8: Basic Analysis of Bin-Packing Heuristics
9: Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest
10: How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
11: Enumeration of Far-Apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
12: Exponentially Improved Dimensionality Reduction for $\ell_1$: Subspace Embeddings and Independence Testing
13: Minimum Stable Cut and Treewidth
14: Fully-dynamic Weighted Matching Approximation in Practice
15: Parallel K-Clique Counting on GPUs
16: There is no APTAS for 2-dimensional vector bin packing: Revisited
17: Hypersuccinct Trees – New universal tree source codes for optimal compressed tree data structures and range minima
18: Kernelization, Proof Complexity and Social Choice