1. Minimizing Mean Completion Time in a Batch Processing System

   • Xiaotie Deng
   • Haodi Feng
   • Hong Zhu

   OriginalPaper 05 December 2003 Pages: 513 - 528

2. Minimum k Arborescences with Bandwidth Constraints

   • Mao-cheng Cai
   • Xiaotie Deng
   • Lusheng Wang

   OriginalPaper 05 December 2003 Pages: 529 - 537

3. Disk Embeddings of Planar Graphs

   • Zhi-Zhong Chen
   • Xin He

   OriginalPaper 05 December 2003 Pages: 539 - 576

4. Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

   • Michael J. Spriggs
   • J. Mark Keil
   • Jack Snoeyink

   OriginalPaper 05 December 2003 Pages: 577 - 589

5. Erratum to “Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes”

   • Fréderic Chazal
   • Véronique Maume-Deschamps
   • Brigitte Vallée

   OriginalPaper 19 December 2003 Pages: 591 - 596

6. Algorithms for Minimizing Response Time in Broadcast Scheduling

   • Rajiv Gandhi
   • Samir Khuller
   • Yung-Chun (Justin) Wan

   OriginalPaper 19 December 2003 Pages: 597 - 608