Volume 34,
Number 1,
January 2000
- S. Muthukrishnan:
Simple Optimal Parallel Multiple Pattern Matching.
1-13
- Franz Höfting, Egon Wanke:
Polynomial-Time Analysis of Toroidal Periodic Graphs.
14-39
- Farhad Shahrokhi, Weiping Shi:
On Crossing Sets, Disjoint Sets, and Pagenumber.
40-53
- Klaus Jansen:
Approximation Results for the Optimum Cost Chromatic Partition Problem.
54-89
- Biing-Feng Wang:
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network.
90-108
- Hagit Attiya:
Efficient and Robust Sharing of Memory in Message-Passing Systems.
109-127
- Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster:
Self-Simulation for the Passive Optical Star.
128-147
- Nicola Galli:
Average Costs of a Graph Exploration: Upper and Lower Bounds.
148-176
- Ravindra K. Ahuja, James B. Orlin:
A Faster Algorithm for the Inverse Spanning Tree Problem.
177-193
- Tao Jiang, Paul E. Kearney, Ming Li:
Some Open Problems in Computational Molecular Biology.
194-201
Volume 34,
Number 2,
February 2000
- Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph.
203-221
- Monika Rauch Henzinger, Satish Rao, Harold N. Gabow:
Computing Vertex Connectivity: New Bounds from Old Techniques.
222-250
- Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.
251-281
- Marek Chrobak, John Noga:
Competitive Algorithms for Relaxed List Update and Multilevel Caching.
282-308
- James F. Korsh, Paul LaFollette:
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence.
309-336
- Wun-Tat Chan, Francis Y. L. Chin:
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids.
337-369
- Sally A. Goldman, Jyoti Parwatikar, Subhash Suri:
Online Scheduling with Hard Deadlines.
370-389
- Ajai Kapoor, Romeo Rizzi:
Edge-Coloring Bipartite Graphs.
390-396
Copyright © Sat Nov 28 22:30:57 2009
by Michael Ley (ley@uni-trier.de)
