Volume 203,
Number 1,
6 August 1998
Graph-theoretic Concepts in Computer Science
- Krzysztof Diks, Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.
3-29
Electronic Edition (link) BibTeX
- Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz:
Switchbox Routing in VLSI Design: Closing the Complexity Gap.
31-49
Electronic Edition (link) BibTeX
- Pierluigi Crescenzi, Paolo Penna:
Strictly-upward Drawings of Ordered Search Trees.
51-67
Electronic Edition (link) BibTeX
- Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
A Uniform Approach to Semi-Dynamic Problems on Digraphs.
69-90
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Jens Gustedt:
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes.
123-141
Electronic Edition (link) BibTeX
- Tadao Takaoka:
Shortest Path Algorithms for Nearly Acyclic Directed Graphs.
143-150
Electronic Edition (link) BibTeX
- Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg:
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
151-162
Electronic Edition (link) BibTeX
- Krzysztof Diks, Andrzej Pelc:
System Diagnosis with Smallest Risk of Error.
163-173
Electronic Edition (link) BibTeX
Volume 203,
Number 2,
28 August 1998
Copyright © Fri Oct 3 23:26:22 2008
by Michael Ley (ley@uni-trier.de)
