1: Improved Spectral-Norm Bounds for Clustering
2: Additive Approximation for Near-Perfect Phylogeny Construction
3: Improving the Asymmetric TSP by Considering Graph Structure
4: Constrained multilinear detection for faster functional motif discovery
5: Comparison of Bucket Sort and RADIX Sort
6: Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis
7: A Classification for Community Discovery Methods in Complex Networks
8: A Dynamic Programming Algorithm for Inference in Recursive Probabilistic Programs
9: Approximation Algorithm for Non-Boolean MAX k-CSP
10: An Infinite Class of Sparse-Yao Spanners
11: Balls into Bins: strict Capacities and Edge Weights
12: A simpler proof for O(congestion + dilation) packet routing
13: Block Iterative Eigensolvers for Sequences of Correlated Eigenvalue Problems
14: Tree decomposition and parameterized algorithms for RNA structure-sequence alignment including tertiary interactions and pseudoknots
15: On the combinatorics of suffix arrays
16: Clustering to Maximize the Ratio of Split to Diameter
17: A Hybrid Algorithm for Convex Semidefinite Optimization
18: A polynomial-time algorithm for planar multicuts with few source-sink pairs
19: On Epsilon-Nets, Distance Oracles, and Metric Embeddings
20: Designing Incoherent Dictionaries for Compressed Sensing: Algorithm Comparison
21: Fast Computation of Subpath Kernel for Trees
22: Projection-free Online Learning
23: Approximate Principal Direction Trees
24: Comparison-Based Learning with Rank Nets
25: Quasi-Succinct Indices
26: Allocation of Divisible Goods under Lexicographic Preferences
27: Upper and Lower Bounds on the Cost of a Map-Reduce Computation
28: Reachability Under Uncertainty
29: Optimal compression of hash-origin prefix trees
30: Constraint satisfaction parameterized by solution size
31: Planarizing an Unknown Surface
32: A Tractable Approach to Finding Closest Truncated-commute-time Neighbors in Large Graphs