1. Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems

   • Jianer Chen
   • Iyad A. Kanj
   • Ge Xia

   OriginalPaper 16 February 2005 Pages: 245 - 273

2. Representing Trees of Higher Degree

   • David Benoit
   • Erik D. Demaine
   • S. Srinivasa Rao

   OriginalPaper 21 February 2005 Pages: 275 - 292

3. Rooted Maximum Agreement Supertrees

   • Jesper Jansson
   • Joseph H.-K. Ng
   • Wing-Kin Sung

   OriginalPaper 14 March 2005 Pages: 293 - 307

4. Optimal Read-Once Parallel Disk Scheduling

   • Mahesh Kallahalla
   • Peter J. Varman

   OriginalPaper 21 January 2005 Pages: 309 - 343