| 1 | -- | 0 | Harold N. Gabow. Editor s foreword |
| 2 | -- | 13 | Raphael Yuster, Uri Zwick. Fast sparse matrix multiplication |
| 14 | -- | 32 | Jeff Edmonds, Kirk Pruhs. A maiden analysis of longest wait first |
| 33 | -- | 47 | Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. Fixed-parameter algorithms for (::::k::::, ::::r::::)-center in planar graphs and map graphs |
| 48 | -- | 73 | Micah Adler, Dan Rubenstein. Pricing multicasting in more flexible network models |
| 74 | -- | 101 | Guy Even, Guy Kortsarz, Wolfgang Slany. On network design problems: fixed cost flows and the covering steiner problem |
| 102 | -- | 106 | Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup. Black box for constant-time insertion in priority queues (note) |
| 107 | -- | 122 | Doratha E. Drake Vinkemeier, Stefan Hougardy. A linear-time approximation algorithm for weighted matchings in graphs |
| 123 | -- | 142 | Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner. Analysis of linear combination algorithms in cryptography |
| 143 | -- | 156 | Katarína Cechlárová, Tamás Fleiner. On a generalization of the stable roommates problem |
| 157 | -- | 159 | Samir Khuller. Problems column |
| 160 | -- | 176 | David S. Johnson. The NP-completeness column |