1: Constant Factor Approximation for Balanced Cut in the PIE model
2: Correlation Clustering with Noisy Partial Information
3: Parallel Algorithms for Counting Triangles in Networks with Large Degrees
4: The asymptotic complexity of matrix reduction over finite fields
5: Efficient Algorithms for de novo Assembly of Alternative Splicing Events from RNA-seq Data
6: The Moser-Tardos Framework with Partial Resampling
7: From Black-Scholes to Online Learning: Dynamic Hedging under Adversarial Environments
8: Fault Tolerant Approximate BFS Structures
9: Linear-time Computation of Minimal Absent Words Using Suffix Array
10: A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians
11: On the Convergence Rate of Decomposable Submodular Function Minimization
12: On the Complexity of Clustered-Level Planarity and T-Level Planarity
13: Fixed-Parameter Tractability of Token Jumping on Planar Graphs
14: Linear-Time Algorithm for Sliding Tokens on Trees
15: Boolean Algebraic Programs as a Methodology for Symbolically Demonstrating Lower and Upper Bounds of Algorithms and Determinism
16: Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned
17: Noncooperative algorithms in self-assembly
18: A branch and price procedure for the container premarshalling problem
19: Guruswami-Sinop Rounding without Higher Level Lasserre
20: On the Synchronization Rate for e-machines
21: A Tight Lower Bound for Decrease-Key in the Pure Heap Model