Volume 18, Number 1, May 1997
: A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem.
Volume 18, Number 2, June 1997
: A Simpler Minimum Spanning Tree Verification Algorithm.
Volume 18, Number 3, July 1997
First European Symposium and Algorithms
: On the Influence of Lookahead in Competitive Paging Algorithms.
: Multicommodity Flows in Even, Planar Networks.
Volume 18, Number 4, August 1997
: Detecting False Matches in String-Matching Algorithms.
: Equivalence of Binary and Ternary Algebraic Decision Trees.
: A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs.
, Bahman Kalantari
: A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors.