1: Sum-of-squares hierarchy lower bounds for symmetric formulations
2: Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
3: Using Optimization to Solve Positive LPs Faster in Parallel
4: Deterministic Near-Optimal P2P Streaming
5: A Multivariate Framework for Weighted FPT Algorithms
6: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
7: On the Enumeration of Minimal Dominating Sets and Related Notions
8: Planar Graphs: Random Walks and Bipartiteness Testing
9: Time lower bounds for nonadaptive turnstile streaming algorithms
10: Restricted Isometry Property for General p-Norms
11: $LCSk$++: Practical similarity metric for long strings
12: Making the Most of Your Samples
13: An improved analysis of the M"omke-Svensson algorithm for graph-TSP on subquartic graphs
14: Replacing Mark Bits with Randomness in Fibonacci Heaps
15: Balanced Allocation on Graphs: A Random Walk Approach
16: Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP’s
17: Lock-in Problem for Parallel Rotor-router Walks
18: Graph-TSP from Steiner Cycles
19: Approximate Range Emptiness in Constant Time and Optimal Space
20: Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
21: Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts
22: Bigtable Merge Compaction
23: Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs
24: 2-Edge Connectivity in Directed Graphs
25: Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
26: Density Adaptive Parallel Clustering
27: LP-Based Algorithms for Capacitated Facility Location
28: Selection from read-only memory with limited workspace
29: Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps
30: Semi-Streaming Algorithms for Annotated Graph Streams
31: Group Testing with Pools of Fixed Size