Journals in DBLP

J. Algorithms
2000, volume: 35, number: 2

1. Norbert Blum
   Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:35, n:2, pp:129-168 [Journal]
   
2. Stephen Alstrup, Mikkel Thorup
   Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:35, n:2, pp:169-188 [Journal]
   
3. Mikkel Thorup
   Floats, Integers, and Single Source Shortest Paths. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:35, n:2, pp:189-201 [Journal]
   
4. Tsan-sheng Hsu
   On Four-Connecting a Triconnected Graph. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:35, n:2, pp:202-234 [Journal]
   
5. Zhivko Prodanov Nedev, Peter T. Wood
   A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:35, n:2, pp:235-259 [Journal]