Exact Algorithms for Linear Programming over Algebraic Extensions Beling OriginalPaper Pages: 459 - 478
Grade of Service Steiner Minimum Trees in the Euclidean Plane Xue-H. Lin-Z. Du OriginalPaper Pages: 479 - 500
Relaxed Balance Using Standard Rotations LarsenSoisalon-SoininenWidmayer OriginalPaper Pages: 501 - 512
Bounding the Inefficiency of Length-Restricted Prefix Codes MilidiúLaber OriginalPaper Pages: 513 - 529
Reconstructing a Minimum Spanning Tree after Deletion of Any Node DasLoui OriginalPaper Pages: 530 - 547