Journal of Algorithms, Volume 17

Volume 17, Number 1, July 1994

• Joseph C. Culberson, Robert A. Reckhow:
  Covering Polygons Is Hard. 2-44
  
• Michael L. Fredman, Deborah L. Goldsmith:
  Three Stacks. 44-70
  
• Seth M. Malitz:
  Graphs with E Edges Have Pagenumber O(sqrt(E)). 71-84
  
• Seth M. Malitz:
  Genus g Graphs Have Pagenumber O(sqrt(g)). 85-109
  
• Yoram Moses, Orli Waarts:
  Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. 110-156
  
• Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao:
  Randomized Routing and Sorting on Fixed-Connection Networks. 157-205
  

Volume 17, Number 2, September 1994

• Fanica Gavril, V. Toledano Laredo, Dominique de Werra:
  Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. 207-221
  
• Guy Kortsarz, David Peleg:
  Generating Sparse 2-Spanners. 222-236
  
• David Eppstein:
  Offline Algorithms for Dynamic Minimum Spanning Tree Problems. 237-250
  
• Tze-Heng Ma, Jeremy Spinrad:
  On the 2-Chain Subgraph Cover and Related Problems. 251-268
  
• E. T. Kofler, Cornelius T. Leondes:
  Algorithmic Modifications to the Theory of Evidential Reasoning. 269-279
  
• Samir Khuller, Uzi Vishkin, Neal E. Young:
  A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. 280-289
  

Volume 17, Number 3, November 1994

• Pankaj K. Agarwal, Micha Sharir, Sivan Toledo:
  Applications of Parametric Searching in Geometric Optimization. 292-318
  
• Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
  Online Navigation in a Room. 319-341
  
• Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn:
  Dynamic Point Location in General Subdivisions. 342-380
  
• Piotr Berman, Viswanathan Ramaiyer:
  Improved Approximations for the Steiner Tree Problem. 381-408
  
• Martin Fürer, Balaji Raghavachari:
  Approximating the Minimum-Degree Steiner Tree to within One of Optimal. 409-423
  
• Jianxiu Hao, James B. Orlin:
  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. 424-446
  
• V. King, S. Rao, Robert Endre Tarjan:
  A Faster Deterministic Maximum Flow Algorithm. 447-474
  
• Mihalis Yannakakis:
  On the Approximation of Maximum Satisfiability. 475-502
  

Last update Sat May 25 16:20:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page