1: Combinatorics and algorithms for augmenting graphs
2: Fusion Tree Sorting
3: Algorithms for Maximum Agreement Forest of Multiple General Trees
4: Provable Submodular Minimization using Wolfe’s Algorithm
5: How Many Workers to Ask? Adaptive Exploration for Collecting High Quality Labels
6: On the Importance of Registers for Computability
7: Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms
8: $\epsilon$-Kernel Coresets for Stochastic Points
9: SALT. A unified framework for all shortest-path query variants on road networks
10: Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence
11: Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
12: PH = PSPACE
13: Towards Tight Lower Bounds for Range Reporting on the RAM
14: A Weighted Common Subgraph Matching Algorithm
15: An exact characterization of tractable demand patterns for maximum disjoint path problems
16: Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures
17: Streaming, Memory Limited Algorithms for Community Detection
18: Fully Dynamic Bin Packing Revisited
19: More Tight Bounds for Active Self-Assembly Using an Insertion Primitive
20: Jointly Private Convex Programming
21: Fast Exact Matrix Completion with Finite Samples
22: Nearly Linear-Time Packing and Covering LP Solvers
23: MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
24: Faster Exact Search using Document Clustering
25: How Well Can Graphs Represent Wireless Interference?
26: Election vs. Selection: Two Ways of Finding the Largest Node in a Graph
27: Approximate k-flat Nearest Neighbor Search
28: Tree decompositions and social graphs
29: Metric and non-metric proximity transformations at linear costs
30: Optimal Data Structures for Farthest-Point Queries in Cactus Networks
31: Scaling Algorithms for Weighted Matching in General Graphs