Volume 35,
Number 1,
April 2000
Volume 35,
Number 2,
May 2000
- Norbert Blum:
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology.
129-168
- Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.
169-188
- Mikkel Thorup:
Floats, Integers, and Single Source Shortest Paths.
189-201
- Tsan-sheng Hsu:
On Four-Connecting a Triconnected Graph.
202-234
- Zhivko Prodanov Nedev, Peter T. Wood:
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs.
235-259
Copyright © Mon Nov 2 21:43:01 2009
by Michael Ley (ley@uni-trier.de)