David Pisinger Linear Time Algorithms for Knapsack Problems with Bounded Weights. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:1-14 [Journal]

Lisa Fleischer Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:51-72 [Journal]

Anders Yeo A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:1, pp:124-139 [Journal]