1: Track Layouts, Layered Path Decompositions, and Leveled Planarity
2: On Fair Size-Based Scheduling
3: Improved Competitive Analysis of Online Scheduling Deadline-Sensitive Jobs
4: Private Approximations of the 2nd-Moment Matrix Using Existing Techniques in Linear Regression
5: Shifted Matroid Optimization
6: Improved Purely Additive Fault-Tolerant Spanners
7: I/O-Efficient Similarity Join
8: Approximation Algorithms for Connected Maximum Cut and Related Problems
9: On the Approximability of Digraph Ordering
10: Fast, Provable Algorithms for Isotonic Regression in all $\ell_{p}$-norms
11: Approximate Deadline-Scheduling with Precedence Constraints
12: Truthful Online Scheduling with Commitments
13: Online Self-Indexed Grammar Compression
14: Optimal linear Bernoulli factories for small mean problems
15: Using the Johnson-Lindenstrauss lemma in linear and integer programming
16: Value and Policy Iteration in Optimal Control and Adaptive Dynamic Programming
17: Lambda-Policy Iteration: A Review and a New Implementation
18: Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey
19: APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
20: Explicit Expanding Expanders
21: Computing Runs on a General Alphabet
22: Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II
23: DiffNodesets: An Efficient Structure for Fast Mining Frequent Itemsets
24: Sorting and Permuting without Bank Conflicts on GPUs
25: Sorting Networks: to the End and Back Again
26: Fast and Simple Computation of Top-k Closeness Centralities
27: Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges
28: A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface
29: Path-Fault-Tolerant Approximate Shortest-Path Trees
30: The Temp Secretary Problem
31: Space-Efficient Plane-Sweep Algorithms
32: The Restricted Isometry Property of Subsampled Fourier Matrices