1: GPU sample sort
2: Linear Complementarity Algorithms for Infinite Games
3: Algorithms for finding dispensable variables
4: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
5: Finding Associations and Computing Similarity via Biased Pair Sampling
6: Supporting Lock-Free Composition of Concurrent Data Objects
7: Stackelberg Pricing is Hard to Approximate within $2-\epsilon$
8: Exact Covers via Determinants
9: Combining Approximation Algorithms for the Prize-Collecting TSP
10: Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover
11: Clustering with shallow trees
12: The Knapsack Problem with Neighbour Constraints
13: Improved Analysis of a Max Cut Algorithm Based on Spectral Partitioning
14: Optimal deterministic ring exploration with oblivious asynchronous robots
15: Embedding into the rectilinear plane in optimal O(star)(n^2)
16: Sorting from Noisy Information