1: A Simple Algorithm For Replacement Paths Problem
2: On a Natural Dynamics for Linear Programming
3: Constant Factor Approximation for ATSP with Two Edge Weights
4: Which Regular Expression Patterns are Hard to Match?
5: Max-sum diversity via convex programming
6: A PAC Approach to Application-Specific Algorithm Selection
7: Longest Gapped Repeats and Palindromes
8: Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling
9: Approximation Algorithms for Route Planning with Nonlinear Objectives
10: An approximation algorithm for Uniform Capacitated k-Median problem with 1 + {\epsilon} capacity violation
11: Tradeoffs for nearest neighbors on the sphere
12: Calculating the Unrooted Subtree Prune-and-Regraft Distance
13: Cost Minimizing Online Algorithms for Energy Storage Management with Worst-case Guarantee
14: On the Computational Complexity of Limit Cycles in Dynamical Systems
15: Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}
16: A Note on Fault Tolerant Reachability for Directed Graphs
17: Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
18: Reordering GPU Kernel Launches to Enable Efficient Concurrent Execution
19: A Short Survey on Data Clustering Algorithms
20: Max-Cut under Graph Constraints
21: On the hardness of learning sparse parities
22: A tight lower bound for Vertex Planarization on graphs of bounded treewidth
23: Engineering Oracles for Time-Dependent Road Networks
24: On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals
25: Decidability and Complexity for Quiescent Consistency and its Variations
26: Simultaneous Private Learning of Multiple Concepts
27: Predecessor problem on smooth distributions
28: A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
29: Tight Bounds for Gomory-Hu-like Cut Counting
30: Word Existence Algorithm