1: Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
2: Differentially Private Distributed Constrained Optimization
3: Hitting forbidden subgraphs in graphs of bounded treewidth
4: Online Clique Clustering
5: Sketching as a Tool for Numerical Linear Algebra
6: Welfare Maximization with Production Costs: A Primal Dual Approach
7: Dynamic Facility Location via Exponential Clocks
8: Scalable Wake-up of Multi-Channel Single-Hop Radio Networks
9: Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems
10: Kernelization and Sparseness: the case of Dominating Set
11: Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP
12: Aggregating partial rankings with applications to peer grading in massive online open courses
13: Sunflowers and Testing Triangle-Freeness of Functions
14: Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
15: Sample(x)=(a(star)x<=t) is a distinguisher with probability 1/8
16: Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions
17: Deterministic Edge Connectivity in Near-Linear Time
18: PivotCompress: Compression by Sorting
19: Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints
20: Fast Matrix Multiplication: Limitations of the Laser Method
21: Approximating capacitated $k$-median with $(1+\epsilon)k$ open facilities
22: Computing minimal interpolants in $C^{1,1}(\mathbb{R}^d)$
23: The Online Disjoint Set Cover Problem and its Applications
24: Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems
25: Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
26: Planar Reachability in Linear Space and Constant Time