1: A lazy approach to on-line bipartite matching
2: Tighter Low-rank Approximation via Sampling the Leveraged Element
3: Cheeger-type approximation for sparsest $st$-cut
4: An improved approximation algorithm for k-median problem using a new factor-revealing LP
5: Models for the k-metric dimension
6: Online Network Design Algorithms via Hierarchical Decompositions
7: Consistent Weighted Sampling Made Fast, Small, and Easy
8: An Efficient Algorithm for Unweighted Spectral Graph Sparsification
9: Minimum Linear Arrangement of Series-Parallel Graphs
10: Weighted sampling of outer products
11: Optimal Time Random Access to Grammar-Compressed Strings in Small Space
12: A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem
13: Settling the Randomized k-sever Conjecture on Some Special Metrics
14: On Succinct Representations of Binary Trees
15: Rearrangement Problems with Duplicated Genomic Markers
16: Gowers Norm, Function Limits, and Parameter Estimation
17: Mixing Color Coding-Related Techniques
18: Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems
19: Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities
20: Structural Parameterizations of the Mixed Chinese Postman Problem
21: On the Influence of Graph Density on Randomized Gossiping
22: Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models
23: Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)
24: Building a Balanced k-d Tree in O(kn log n) Time
25: On Symmetric and Asymmetric LSHs for Inner Product Search
26: Polynomials: a new tool for length reduction in binary discrete convolutions