nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
All-Pairs Min-Cut in Sparse Networks
|
Arikati, Srinivasa R |
|
1998 |
29 |
1 |
p. 82-110 29 p. |
artikel |
2 |
Approximating Clique and Biclique Problems
|
Hochbaum, Dorit S. |
|
1998 |
29 |
1 |
p. 174-200 27 p. |
artikel |
3 |
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
|
Lu, Hsueh-I |
|
1998 |
29 |
1 |
p. 132-141 10 p. |
artikel |
4 |
Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
|
Walsh, Timothy R. |
|
1998 |
29 |
1 |
p. 165-173 9 p. |
artikel |
5 |
On the Comparison Complexity of the String Prefix-Matching Problem
|
Breslauer, Dany |
|
1998 |
29 |
1 |
p. 18-67 50 p. |
artikel |
6 |
Optimal Constructions of Hybrid Algorithms
|
Kao, Ming-Yang |
|
1998 |
29 |
1 |
p. 142-164 23 p. |
artikel |
7 |
Papers to Appear in Forthcoming Issues
|
|
|
1998 |
29 |
1 |
p. 201- 1 p. |
artikel |
8 |
Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
|
Rajasekaran, Sanguthevar |
|
1998 |
29 |
1 |
p. 68-81 14 p. |
artikel |
9 |
Thek-Steiner Ratio in the Rectilinear Plane
|
Borchers, Al |
|
1998 |
29 |
1 |
p. 1-17 17 p. |
artikel |
10 |
Tree Powers
|
Kearney, Paul E |
|
1998 |
29 |
1 |
p. 111-131 21 p. |
artikel |