1: Improved RIP Analysis of Orthogonal Matching Pursuit
2: LGM: Mining Frequent Subgraphs from Linear Graphs
3: Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
4: On Dynamic Optimality for Binary Search Trees
5: A nearly-mlogn time solver for SDD linear systems
6: The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
7: Upper Bounds for Maximally Greedy Binary Search Trees
8: Physical expander in Virtual Tree Overlay
9: Approximation Algorithms for Union and Intersection Covering Problems
10: Structure-Aware Sampling: Flexible and Accurate Summarization
11: SqFreeEVAL: An (almost) optimal real-root isolation algorithm
12: A Nearly-Quadratic Gap Between Adaptive and Non-Adaptive Property Testers
13: Tight Bounds for Parallel Randomized Load Balancing
14: On the van der Waerden numbers w(2;3,t)
15: Nonrepetitive sequences on arithmetic progressions
16: Obtaining a Bipartite Graph by Contracting Few Edges
17: Minimum Makespan Multi-vehicle Dial-a-Ride
18: Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves
19: An Implicit Cover Problem in Wild Population Study
20: Minimum multicuts and Steiner forests for Okamura-Seymour graphs
21: A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem
22: Pseudo-random graphs and bit probe schemes with one-sided error
23: Hierarchical Heavy Hitters with the Space Saving Algorithm