Journal of Algorithms, Volume 22

Volume 22, Number 1, January 1997

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

Volume 22, Number 2, February 1997

• Piotr Berman, Krzysztof Diks, Andrzej Pelc:
  Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. 199-211
  
• David Fernández-Baca, Giora Slutzki:
  Optimal Parametric Search on Graphs of Bounded Tree-Width. 212-240
  
• Philip N. Klein, Serge A. Plotkin, Satish Rao, Éva Tardos:
  Approximation Algorithms for Steiner and Directed Multicuts. 241-269
  
• Pilar de la Torre, David T. Kao:
  A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys. 217-295
  
• Paolo Ferragina:
  Dynamic Text Indexing under String Updates. 296-328
  
• Christine Rüb:
  On the Average Running Time of Odd-Even Merge Sort. 329-346
  
• John H. Reif, Stephen R. Tate:
  On Dynamic Algorithms for Algebraic Problems. 347-371
  
• James Jianghai Fu:
  Directed Graph Pattern Matching and Topological Embedding. 372-391
  

Last update Tue Feb 14 04:19:57 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page