1: Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation)
2: Maximizing Utility Among Selfish Users in Social Groups
3: Approximation Algorithms for the Max-Buying Problem with Limited Supply
4: Dynamic Gomory-Hu Tree Construction – fast and simple
5: Protein Threading Based on Nonlinear Integer Programming
6: On the optimality of approximation schemes for the classical scheduling problem
7: Revisiting the Problem of Searching on a Line
8: Compressed Counting Meets Compressed Sensing
9: Approximate String Matching using a Bidirectional Index
10: Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets
11: Gap Amplification for Small-Set Expansion via Random Walks
12: QuickLexSort: An efficient algorithm for lexicographically sorting nested restrictions of a database