Derandomizing Approximation Algorithms Based on Semidefinite Programming
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
New Lower Bounds for Convex Hull Problems in Odd Dimensions
Better Bounds for Online Scheduling
Tight Analyses of Two Local Load Balancing Algorithms