| 36 | -- | 0 | Harold N. Gabow, Michael A. Bender, Martin Farach-Colton. Introduction to SODA 2002 and 2003 special issue |
| 37 | -- | 0 | James Aspnes, Gauri Shah. Skip graphs |
| 38 | -- | 0 | Yijie Han. Optimal parallel selection |
| 39 | -- | 0 | Nikhil Bansal, Kedar Dhamdhere. Minimizing weighted flow time |
| 40 | -- | 0 | Jittat Fakcharoenphol, Chris Harrelson, Satish Rao. The ::::k::::-traveling repairmen problem |
| 41 | -- | 0 | Sandy Irani, Sandeep K. Shukla, Rajesh Gupta. Algorithms for power savings |
| 42 | -- | 0 | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan. Guessing secrets efficiently via list decoding |
| 43 | -- | 0 | Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti. Succinct indexable dictionaries with applications to encoding ::::k::::-ary trees, prefix sums and multisets |
| 44 | -- | 0 | Svante Janson, Wojciech Szpankowski. Partial fillup and search time in LC tries |
| 45 | -- | 0 | John Hershberger, Matthew Maxel, Subhash Suri. Finding the ::::k:::: shortest simple paths: A new algorithm and its implementation |
| 46 | -- | 0 | Chandra Chekuri, Sanjeev Khanna. Edge-disjoint paths revisited |
| 47 | -- | 0 | Joseph Cheriyan, Mohammad R. Salavatipour. Packing element-disjoint steiner trees |
| 48 | -- | 0 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster. Approximation algorithms and hardness results for cycle packing problems |
| 49 | -- | 0 | Susanne Albers, Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization |
| 50 | -- | 0 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. Improved online algorithms for buffer management in QoS switches |
| 51 | -- | 0 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton. Oblivious routing on node-capacitated and directed graphs |
| 52 | -- | 0 | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano. Routing selfish unsplittable traffic |