1: Fully Dynamic $(1+\epsilon)$-Approximate Matchings
2: Top-K Product Design Based on Collaborative Tagging Data
3: Algorithms for Routing an Unmanned Aerial Vehicle in the presence of Refueling Depots
4: Efficient repeat finding via suffix arrays
5: Performance of the Metropolis algorithm on a disordered tree: The Einstein relation
6: Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
7: Bose-Einstein Condensation in Satisfiability Problems
8: Timing in chemical reaction networks
9: A Succinct Grammar Compression
10: Average Case and Distributional Analysis of Dual-Pivot Quicksort
11: Linear-in-$\Delta$ Lower Bounds in the LOCAL Model
12: An Improved LR-aided K-Best Algorithm for MIMO Detection
13: How to Approximate A Set Without Knowing Its Size In Advance
14: Solving Linear Programming with Constraints Unknown
15: Randomness-Efficient Rumor Spreading
16: Improved approximation for 3-dimensional matching via bounded pathwidth local search
17: Cutting corners cheaply, or how to remove Steiner points
18: How Hard is Counting Triangles in the Streaming Model
19: Dimension Independent Matrix Square using MapReduce
20: Large-Treewidth Graph Decompositions and Applications
21: Online Power-Managing Strategy with Hard Real-Time Guarantees
22: A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
23: Analytic Samplers and the Combinatorial Rejection Method
24: Optimal Discrete Uniform Generation from Coin Flips, and Applications