1: Fast, precise and dynamic distance queries
2: On a game theoretic approach to capacity maximization in wireless networks
3: Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions
4: A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions
5: The universality of iterated hashing over variable-length strings
6: Nash Equilibria in Perturbation Resilient Games
7: Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
8: Flow-Cut Gaps for Integer and Fractional Multiflows
9: Submodular Functions: Learnability, Structure, and Optimization