Klaus Jansen Approximation Results for the Optimum Cost Chromatic Partition Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:1, pp:54-89 [Journal]

Biing-Feng Wang Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:1, pp:90-108 [Journal]

Hagit Attiya Efficient and Robust Sharing of Memory in Message-Passing Systems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:1, pp:109-127 [Journal]

Nicola Galli Average Costs of a Graph Exploration: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:1, pp:148-176 [Journal]