1: Near-Optimum Online Ad Allocation for Targeted Advertising
2: ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
3: Improved Bounds for the Flat Wall Theorem
4: An improved, easily computable combinatorial lower bound for weighted graph bipartitioning
5: The Unreasonable Success of Local Search: Geometric Optimization
6: A massively parallel algorithm for constructing the BWT of large string sets
7: Quick Detection of High-degree Entities in Large Directed Networks
8: An Algorithmic Metatheorem for Directed Treewidth
9: Fast, memory efficient low-rank approximation of SimRank
10: Space-Efficient Path-Reporting Approximate Distance Oracles
11: Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
12: Improved Algorithms for Parity and Streett objectives
13: Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
14: A Survey on Small-Area Planar Graph Drawing
15: Degree-3 Treewidth Sparsifiers
16: Interactive Fingerprinting Codes and the Hardness of Preventing False Discovery
17: Node-Specific Triad Pattern Mining for Complex-Network Analysis
18: Notes on dual-critical graphs
19: A Truthful Mechanism for the Generalized Assignment Problem