Theoretical Computer Science, Volume 203

Volume 203, Number 1, 6 August 1998

• Krzysztof Diks, Torben Hagerup:
  More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 3-29
  
• Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
  Switchbox Routing in VLSI Design: Closing the Complexity Gap. 31-49
  
• Pierluigi Crescenzi, Paolo Penna:
  Strictly-upward Drawings of Ordered Search Trees. 51-67
  
• Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
  A Uniform Approach to Semi-Dynamic Problems on Digraphs. 69-90
  
• Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi:
  Modifying Edges of a Network to Obtain Short Subgraphs. 91-121
  
• Jens Gustedt:
  Efficient Union-Find for Planar Graphs and other Sparse Graph Classes. 123-141
  
• Tadao Takaoka:
  Shortest Path Algorithms for Nearly Acyclic Directed Graphs. 143-150
  
• Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
  Approximate Maxima Finding of Continuous Functions under Restricted Budget. 151-162
  
• Krzysztof Diks, Andrzej Pelc:
  System Diagnosis with Smallest Risk of Error. 163-173
  

Volume 203, Number 2, 28 August 1998

• Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide:
  Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model. 175-203
  
• Shiva Chaudhuri, Christos D. Zaroliagis:
  Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms. 205-223
  
• Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi:
  Near-Optimal, Distributed Edge Colouring via the Nibble Method. 225-251
  
• Shimon Even, Gene Itkis, Sergio Rajsbaum:
  On Mixed Connectivity Certificates. 253-269