Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.
Approximation in stochastic scheduling: the power of LP-based priority policies.
Analysis of a bounding box heuristic for object intersection.
The topological structure of asynchronous computability.