
Journals in DBLP
J. Algorithms 1989, volume: 10, number: 2
 Gad M. Landau, Uzi Vishkin
Fast Parallel and Serial Approximate String Matching. [Citation Graph (1, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:157169 [Journal]
 Ralf Hartmut Güting, Otto Nurmi, Thomas Ottmann
Fast Algorithms for Direct Enclosures and Direct Dominances. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:170186 [Journal]
 Norishige Chiba, Takao Nishizeki
The Hamiltonian Cycle Problem is LinearTime Solvable for 4Connected Planar Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:187211 [Journal]
 H. Heusinger, Hartmut Noltemeier
On Separable Clusterings. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:212227 [Journal]
 Patricio V. Poblete, J. Ian Munro
LastComeFirstServed Hashing. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:228248 [Journal]
 Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys
The Parallel Complexity of TSP Heuristics. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:249270 [Journal]
 Charles J. Colbourn, Robert P. J. Day, Louis D. Nel
Unranking and Ranking Spanning Trees of a Graph. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:271286 [Journal]
 Karl R. Abrahamson, N. Dadoun, David G. Kirkpatrick, Teresa M. Przytycka
A Simple Parallel Tree Contraction Algorithm. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1989, v:10, n:2, pp:287302 [Journal]
