1: k-Means for Streaming and Distributed Big Sparse Data
2: Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs
3: Non-adaptive Group Testing on Graphs
4: Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round
5: Efficient Deterministic Single Round Document Exchange for Edit Distance
6: The Alternating Stock Size Problem and the Gasoline Puzzle
7: An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem