1: Stochastic billiards for sampling from the boundary of a convex set
2: Simple PTAS’s for families of graphs excluding a minor
3: A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods
4: A unified approach to linear probing hashing with buckets
5: Posimodular Function Optimization
6: Quantum algorithms for shortest paths problems in structured instances
7: On the Average-case Complexity of Parameterized Clique
8: Tight tradeoffs for approximating palindromes in streams
9: Btrim: A fast, lightweight adapter and quality trimming program for next-generation sequencing technologies
10: Some Combinatorial Problems on Halin Graphs
11: Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
12: Practical Massively Parallel Sorting
13: Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
14: A Hardware-oriented Algorithm for Complex-valued Constant Matrix-vector Multiplication
15: A PTAS for Agnostically Learning Halfspaces
16: Scheduling with Gaps: New Models and Algorithms
17: Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model
18: A New Perspective on the Windows Scheduling Problem
19: On $(1,\epsilon)$-Restricted Assignment Makespan Minimization
20: Random-Facet and Random-Bland require subexponential time even for shortest paths
21: Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks
22: Fast Algorithms for Online Stochastic Convex Programming