nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Faster Algorithm for the Inverse Spanning Tree Problem
|
Ahuja, Ravindra K. |
|
2000 |
34 |
1 |
p. 177-193 17 p. |
artikel |
2 |
Approximation Results for the Optimum Cost Chromatic Partition Problem
|
Jansen, Klaus |
|
2000 |
34 |
1 |
p. 54-89 36 p. |
artikel |
3 |
Average Costs of a Graph Exploration: Upper and Lower Bounds
|
Galli, Nicola |
|
2000 |
34 |
1 |
p. 148-176 29 p. |
artikel |
4 |
Efficient and Robust Sharing of Memory in Message-Passing Systems
|
Attiya, Hagit |
|
2000 |
34 |
1 |
p. 109-127 19 p. |
artikel |
5 |
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
|
Wang, Biing-Feng |
|
2000 |
34 |
1 |
p. 90-108 19 p. |
artikel |
6 |
On Crossing Sets, Disjoint Sets, and Pagenumber
|
Shahrokhi, Farhad |
|
2000 |
34 |
1 |
p. 40-53 14 p. |
artikel |
7 |
Papers to Appear in Forthcoming Issues
|
|
|
2000 |
34 |
1 |
p. 202- 1 p. |
artikel |
8 |
Polynomial-Time Analysis of Toroidal Periodic Graphs
|
Höfting, F. |
|
2000 |
34 |
1 |
p. 14-39 26 p. |
artikel |
9 |
Self-Simulation for the Passive Optical Star
|
Berthomé, Pascal |
|
2000 |
34 |
1 |
p. 128-147 20 p. |
artikel |
10 |
Simple Optimal Parallel Multiple Pattern Matching
|
Muthukrishnan, S |
|
2000 |
34 |
1 |
p. 1-13 13 p. |
artikel |
11 |
Some Open Problems in Computational Molecular Biology
|
Jiang, Tao |
|
2000 |
34 |
1 |
p. 194-201 8 p. |
artikel |