Editorial Board
Guest editor's foreword
Extractors from Reed–Muller codes
Fully dynamic all pairs shortest paths with real edge weights
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Planar graphs, negative weight edges, shortest paths, and near linear time
Ramsey-type theorems for metric spaces with applications to online problems
On the severity of Braess's Paradox: Designing networks for selfish users is hard
Papers to appear in forthcoming issues