| 0 | -- | 0 | Haim Kaplan, Robert Endre Tarjan. Thin heaps, thick heaps |
| 0 | -- | 0 | Harold N. Gabow, Shuxin Nie. Finding a long directed cycle |
| 0 | -- | 0 | Elliot Anshelevich, Lisa Zhang. Path decomposition under a new cost measure with applications to optical network design |
| 0 | -- | 0 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. Approximate distance oracles for geometric spanners |
| 0 | -- | 0 | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi. The priority R-tree: A practically efficient and worst-case optimal R-tree |
| 0 | -- | 0 | Gianni Franceschini, Roberto Grossi. No sorting? better searching! |
| 0 | -- | 0 | Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. Improved bounds for scheduling conflicting jobs with minsum criteria |
| 0 | -- | 0 | Daniel Lemire, Owen Kaser. Hierarchical bin buffering: Online local moments for dynamic external memory arrays |
| 0 | -- | 0 | Seth Pettie, Vijaya Ramachandran. Randomized minimum spanning tree algorithms using exponentially fewer random bits |
| 0 | -- | 0 | Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian. Rectangular layouts and contact graphs |
| 0 | -- | 0 | Liam Roditty. A faster and simpler fully dynamic transitive closure |
| 0 | -- | 0 | Jérémy Barbay, Claire Kenyon. Alternation and redundancy analysis of the intersection problem |
| 0 | -- | 0 | George Karakostas. Faster approximation schemes for fractional multicommodity flow problems |
| 0 | -- | 0 | Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh. The collective memory of amnesic processes |
| 0 | -- | 0 | Milan Ruzic. Uniform deterministic dictionaries |