1: Efficient Density Estimation via Piecewise Polynomial Approximation
2: Approximate Distance Oracle with Constant Query Time
3: New Greedy Heuristics For Set Cover and Set Packing
4: Modeling Information Propagation with Survival Theory
5: The Thinnest Path Problem
6: On Structural Parameterizations for the 2-Club Problem
7: 3SUM, 3XOR, Triangles
8: Exploiting non-constant safe memory in resilient algorithms and data structures
9: Multicut Lower Bounds via Network Coding
10: Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
11: Understanding Incentives: Mechanism Design becomes Algorithm Design
12: Belief Propagation for Linear Programming
13: Connected Domatic Packings in Node-capacitated Graphs
14: Implementation of linear maps with circulant matrices via modulo 2 rectifier circuits of bounded depth
15: Entanglement in the Grover’s Search Algorithm
16: The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into $\ell_1$
17: Algorithms for Self-Healing Networks
18: Tight Bounds for Set Disjointness in the Message Passing Model
19: Easy identification of generalized common and conserved nested intervals
20: How modular structure can simplify tasks on networks