1: High-Confidence Predictions under Adversarial Uncertainty
2: Adaptive Submodular Optimization under Matroid Constraints
3: Conflict Packing: an unifying technique to obtain polynomial kernels for editing problems on dense instances
4: Tight Bounds on Information Dissemination in Sparse Mobile Networks
5: Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity
6: Succincter Text Indexing with Wildcards
7: Maintaining Arrays of Contiguous Objects
8: Connection errors in networks of linear features and the application of geometrical reduction in spatial data algorithms
9: Compressed String Dictionaries
10: The complexity of Free-Flood-It on 2xn boards