Algorithmica, Volume 27, 2000

Volume 27, Number 1, 2000

• Steven Fortune:
  Introduction. 1-4
  
• Kokichi Sugihara, Masao Iri, Hiroshi Inagaki, T. Imai:
  Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms. 5-20
  
• Hervé Brönnimann, Mariette Yvinec:
  Efficient Exact Evaluation of Signs of Determinants. 21-56
  
• Victor Milenkovic:
  Shortest Path Geometric Rounding. 57-86
  
• Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra:
  A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. 87-99
  
• Chandrajit L. Bajaj, Andrew V. Royappa:
  Parameterization in Finite Precision. 100-114
  

Volume 27, Number 2, 2000

• Luca Trevisan:
  Erratum: A Correction to ``Parallel Approximation Algorithms by Positive Linear Programming''. 115-119
  
• Sanjiv Kapoor, H. Ramesh:
  An Algorithm for Enumerating All Spanning Trees of a Directed Graph. 120-130
  
• Reuven Bar-Yehuda:
  One for the Price of Two: a Unified Approach for Approximating Covering Problems. 131-144
  
• Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto:
  Binary Searching with Nonuniform Costs and Its Application to Text Retrieval. 145-169
  
• Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap:
  Smallest Enclosing Cylinders. 170-186
  
• G. Sajith, Sanjeev Saxena:
  Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. 187-197
  
• Nili Guttmann-Beck, Refael Hassin:
  Approximation Algorithms for Minimum K-Cut. 198-207
  

Volume 27, Number 3, 2000

• Hans L. Bodlaender:
  Introduction. 209-211
  
• Shiva Chaudhuri, Christos D. Zaroliagis:
  Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. 212-226
  
• Xiao Zhou, K. Fuse, Takao Nishizeki:
  A Linear Algorithm for Finding [{g, f}]-Colorings of Partial {k}-Trees. 227-243
  
• Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
  Generalized Dominators for Structured Programs. 244-253
  
• Arvind Gupta, Damon Kaller, Thomas C. Shermer:
  Linear-Time Algorithms for Partial k-Tree Complements. 254-274
  
• David Eppstein:
  Diameter and Treewidth in Minor-Closed Graph Families. 275-291
  
• Torben Hagerup:
  Dynamic Algorithms for Graphs of Bounded Treewidth. 292-315
  
• Corinne Lucet, Jean-Francois Manouvrier, Jacques Carlier:
  Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. 316-336
  
• Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
  Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. 337-347
  
• Damon Kaller:
  Definability Equals Recognizability of Partial 3-Trees and k-Connected Partial k-Trees. 348-381
  
• Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski:
  Memory Requirements for Table Computations in Partial k-Tree Algorithms. 382-394
  
• Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu:
  Graph Searching on Some Subclasses of Chordal Graphs. 395-426