Volume 41, Number 1, October 2001
, Anders Yeo
: The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
: Approximation Algorithms for Independent Sets in Map Graphs.
Volume 41, Number 2, November 2001
: Optimality and Greed in Dynamic Allocation.
, Eiji Miyano
: An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
: Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms.