Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems Jianer ChenIyad A. KanjGe Xia OriginalPaper 16 February 2005 Pages: 245 - 273
Representing Trees of Higher Degree David BenoitErik D. DemaineS. Srinivasa Rao OriginalPaper 21 February 2005 Pages: 275 - 292
Rooted Maximum Agreement Supertrees Jesper JanssonJoseph H.-K. NgWing-Kin Sung OriginalPaper 14 March 2005 Pages: 293 - 307
Optimal Read-Once Parallel Disk Scheduling Mahesh KallahallaPeter J. Varman OriginalPaper 21 January 2005 Pages: 309 - 343