A Generalization of a Lower Bound Technique due to Fredman and Saks A. M. Ben-AmramZ. Galil OriginalPaper Pages: 34 - 66
Circular Separability of Polygons J. -D. BoissonnatJ. CzyzowiczM. Yvinec OriginalPaper Pages: 67 - 82
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times D. J. RosenkrantzL. YuS. S. Ravi OriginalPaper Pages: 83 - 100
Optimal Search and One-Way Trading Online Algorithms R. El-YanivA. FiatG. Turpin OriginalPaper Pages: 101 - 139