1: Using Hashing to Solve the Dictionary Problem (In External Memory)
2: Self-Assembly with Geometric Tiles
3: A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application
4: Pattern discovery for semi-structured web pages using bar-tree representation
5: Minimum Weight Cycles and Triangles: Equivalences and Algorithms
6: Confluent Persistence Revisited
7: Problems parameterized by treewidth tractable in single exponential time: a logical approach
8: I/O-Efficient Data Structures for Colored Range and Prefix Reporting
9: Approximating Graphic TSP by Matchings
10: On Stabilization in Herman’s Algorithm
11: Parallel Recursive State Compression for Free
12: Improved Approximation Guarantees for Lower-Bounded Facility Location
13: Efficient Seeds Computation Revisited
14: Similarity Join Size Estimation using Locality Sensitive Hashing
15: Practical and Efficient Split Decomposition via Graph-Labelled Trees
16: Practical and Efficient Circle Graph Recognition
17: The Two Bicliques Problem is in NP intersection coNP
18: Contracting Graphs to Paths and Trees
19: Solving the Closest Vector Problem with respect to l_p Norms
20: How to Play Unique Games against a Semi-Random Adversary
21: Directed Nowhere Dense Classes of Graphs
22: Fixed Block Compression Boosting in FM-Indexes
23: Courcelle’s Theorem - A Game-Theoretic Approach
24: Black-and-white threshold graphs
25: An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem
26: Palette-colouring: a belief-propagation approach
27: Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model
28: On Variants of the Matroid Secretary Problem
29: Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
30: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
31: Data Reduction for Graph Coloring Problems