1: Finding a maximum induced degenerate subgraph faster than 2^n
2: Optimal Planar Range Skyline Reporting with Linear Space in External Memory
3: A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting
4: The simplex method is strongly polynomial for deterministic Markov decision processes
5: Almost Optimal Sublinear Time Algorithm for Semidefinite Programming
6: Faster Clustering via Preprocessing
7: Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
8: Compression and Sieve: Reducing Communication in Parallel Breadth First Search on Distributed Memory Systems
9: Hitting all Maximal Independent Sets of a Bipartite Graph
10: Convex Integer Optimization by Constantly Many Linear Counterparts