Volume 33, Number 1, October 1999
: Linear Time Algorithms for Knapsack Problems with Bounded Weights.
: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.
C. R. Subramanian
: Minimum Coloring k-Colorable Graphs in Polynomial Average Time.
: A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph.
Volume 33, Number 2, November 1999
: On Computing the Subset Graph of a Collection of Sets.