1: Lazier Than Lazy Greedy
2: On the Closest Vector Problem with a Distance Guarantee
3: A note on the Minimum Norm Point algorithm
4: Strong Steiner Tree Approximations in Practice
5: Line-distortion, Bandwidth and Path-length of a graph
6: Model Counting for Formulas of Bounded Clique-Width
7: The Minimum Feasible Tileset problem