1. Exact Algorithms for Linear Programming over Algebraic Extensions

   • Beling

   OriginalPaper Pages: 459 - 478

2. Grade of Service Steiner Minimum Trees in the Euclidean Plane

   • Xue
   • -H. Lin
   • -Z. Du

   OriginalPaper Pages: 479 - 500

3. Relaxed Balance Using Standard Rotations

   • Larsen
   • Soisalon-Soininen
   • Widmayer

   OriginalPaper Pages: 501 - 512

4. Bounding the Inefficiency of Length-Restricted Prefix Codes

   • Milidiú
   • Laber

   OriginalPaper Pages: 513 - 529

5. Reconstructing a Minimum Spanning Tree after Deletion of Any Node

   • Das
   • Loui

   OriginalPaper Pages: 530 - 547