1: Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm
2: Random greedy triangle-packing beyond the 7/4 barrier
3: Computing a Maximal Independent Set Using Beeps
4: Succinct Representations of Permutations and Functions
5: How to Cover a Point Set with a V-Shape of Minimum Width
6: Optimal Indexes for Sparse Bit Vectors
7: Graph and Election Problems Parameterized by Feedback Set Numbers
8: Dimension reduction for finite trees in L_1
9: Grothendieck-type inequalities in combinatorial optimization
10: Search on the Brink of Chaos
11: Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests