1: Maximium Priority Matchings
2: Tight Bounds for Approximate Carath'eodory and Beyond
3: The Packing While Traveling Problem
4: The Edge Group Coloring Problem with Applications to Multicast Switching
5: The Bounded Edge Coloring Problem and Offline Crossbar Scheduling
6: Fast Computation of Isochrones in Road Networks
7: Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
8: Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
9: Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
10: Denoising and Completion of 3D Data via Multidimensional Dictionary Learning
11: A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem