Journals in DBLP

J. Algorithms
1997, volume: 22, number: 1

1. Andrew V. Goldberg
   An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:1-29 [Journal]
   
2. Edith Cohen
   Using Selective Path-Doubling for Parallel Shortest-Path Computations. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:30-56 [Journal]
   
3. Leonidas Palios
   Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:57-92 [Journal]
   
4. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
   On-Line Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:93-110 [Journal]
   
5. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
   Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:111-141 [Journal]
   
6. Himanshu Gupta, Rephael Wenger
   Constructing Piecewise Linear Homeomorphisms of Simple Polygons. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:142-157 [Journal]
   
7. Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit
   Slide-The Key to Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:158-186 [Journal]
   
8. Michal Penn, Haya Shasha-Krupnik
   Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1997, v:22, n:1, pp:187-196 [Journal]