| 785 | -- | 0 | Moses Charikar. Guest editor s foreword |
| 786 | -- | 812 | Amnon Ta-Shma, David Zuckerman, Shmuel Safra. Extractors from Reed-Muller codes |
| 813 | -- | 837 | Camil Demetrescu, Giuseppe F. Italiano. Fully dynamic all pairs shortest paths with real edge weights |
| 838 | -- | 867 | Lisa Fleischer, Kamal Jain, David P. Williamson. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems |
| 868 | -- | 889 | Jittat Fakcharoenphol, Satish Rao. Planar graphs, negative weight edges, shortest paths, and near linear time |
| 890 | -- | 921 | Yair Bartal, Béla Bollobás, Manor Mendel. Ramsey-type theorems for metric spaces with applications to online problems |
| 922 | -- | 953 | Tim Roughgarden. On the severity of Braess s Paradox: Designing networks for selfish users is hard |