1: On the Adaptivity Gap of Stochastic Orienteering
2: A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
3: Smoothed Analysis of Tensor Decompositions
4: FPTAS for Counting Monotone CNF
5: Chapter 10: Algebraic Algorithms
6: Deterministic Primality Testing - understanding the AKS algorithm
7: Scheduling Meets Fixed-Parameter Tractability
8: Largest chordal and interval subgraphs faster than 2^n
9: Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits
10: Encoding Range Minimum Queries
11: Efficient algorithms for the longest common subsequence in $k$-length substrings
12: Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming
13: An O(M log M) Algorithm for Bipartite Matching with Roadmap Distances
14: Economic Efficiency Requires Interaction
15: Optimal approximation for submodular and supermodular optimization with bounded curvature
16: Approximation Algorithms for Hard Capacitated $k$-facility Location Problems
17: Editing to a Graph of Given Degrees
18: On the Complexity of Random Satisfiability Problems with Planted Solutions
19: Simultaneous Greedy Analysis Pursuit for Compressive Sensing of Multi-Channel ECG Signals
20: Extended Formulations for Online Linear Bandit Optimization
21: Combining the Shortest Paths and the Bottleneck Paths Problems
22: Influence Diffusion in Social Networks under Time Window Constraints
23: Distributed Connectivity Decomposition