Minimizing Mean Completion Time in a Batch Processing System Xiaotie DengHaodi FengHong Zhu OriginalPaper 05 December 2003 Pages: 513 - 528
Minimum k Arborescences with Bandwidth Constraints Mao-cheng CaiXiaotie DengLusheng Wang OriginalPaper 05 December 2003 Pages: 529 - 537
Disk Embeddings of Planar Graphs Zhi-Zhong ChenXin He OriginalPaper 05 December 2003 Pages: 539 - 576
Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree Michael J. SpriggsJ. Mark KeilJack Snoeyink OriginalPaper 05 December 2003 Pages: 577 - 589
Erratum to “Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes” Fréderic ChazalVéronique Maume-DeschampsBrigitte Vallée OriginalPaper 19 December 2003 Pages: 591 - 596
Algorithms for Minimizing Response Time in Broadcast Scheduling Rajiv GandhiSamir KhullerYung-Chun (Justin) Wan OriginalPaper 19 December 2003 Pages: 597 - 608