
Journals in DBLP
J. Algorithms 1999, volume: 31, number: 1
 Julien Basch, Leonidas J. Guibas, John Hershberger
Data Structures for Mobile Data. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:128 [Journal]
 Gary L. Miller, Dafna Talmor, ShangHua Teng
Optimal Coarsening of Unstructured Meshes. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:2965 [Journal]
 Anthony LaMarca, Richard E. Ladner
The Influence of Caches on the Performance of Sorting. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:66104 [Journal]
 Friedhelm Meyer auf der Heide, Berthold Vöcking
ShortestPath Routing in Arbitrary Networks. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:105131 [Journal]
 William M. Kantor, Eugene M. Luks, Peter D. Mark
Sylow Subgroups in Parallel. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:132195 [Journal]
 Ulrich Faigle, Walter Kern, Willem M. Nawijn
A Greedy OnLine Algorithm for thekTrack Assignment Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:196210 [Journal]
 Toshihiro Fujito
Approximating NodeDeletion Problems for Matroidal Properties. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:211227 [Journal]
 Sudipto Guha, Samir Khuller
Greedy Strikes Back: Improved Facility Location Algorithms. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:228248 [Journal]
 Cristina Bazgan, Miklos Santha, Zsolt Tuza
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:31, n:1, pp:249268 [Journal]
