- Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein:
Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 (2002) - Uwe Schöning:
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. Algorithmica 32(4): 615-623 (2002) - Hadas Shachnai, Tami Tamir:
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints. Algorithmica 32(4): 651-678 (2002) - Jop F. Sibeyn:
One-by-One Cleaning for Practical Parallel List Ranking. Algorithmica 32(3): 345-363 (2002) - Lusheng Wang, Ding-Zhu Du:
Approximations for a Bottleneck Steiner Tree Problem. Algorithmica 32(4): 554-561 (2002) - Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen:
Distributed and On-Line Routing on Tori. Algorithmica 32(4): 562-593 (2002)