| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Bounding the Inefficiency of Length-Restricted Prefix Codes
|
Milidiú,
|
|
Inc.
|
31 |
4 |
p. 513-529
|
artikel
|
| 2 |
Bounding the Inefficiency of Length-Restricted Prefix Codes
|
Milidiú,
|
|
2001
|
31 |
4 |
p. 513-529
|
artikel
|
| 3 |
Exact Algorithms for Linear Programming over Algebraic Extensions
|
Beling,
|
|
Inc.
|
31 |
4 |
p. 459-478
|
artikel
|
| 4 |
Exact Algorithms for Linear Programming over Algebraic Extensions
|
Beling,
|
|
2001
|
31 |
4 |
p. 459-478
|
artikel
|
| 5 |
Grade of Service Steiner Minimum Trees in the Euclidean Plane
|
Xue,
|
|
Inc.
|
31 |
4 |
p. 479-500
|
artikel
|
| 6 |
Grade of Service Steiner Minimum Trees in the Euclidean Plane
|
Xue,
|
|
2001
|
31 |
4 |
p. 479-500
|
artikel
|
| 7 |
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
|
Das,
|
|
Inc.
|
31 |
4 |
p. 530-547
|
artikel
|
| 8 |
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
|
Das,
|
|
2001
|
31 |
4 |
p. 530-547
|
artikel
|
| 9 |
Relaxed Balance Using Standard Rotations
|
Larsen,
|
|
Inc.
|
31 |
4 |
p. 501-512
|
artikel
|
| 10 |
Relaxed Balance Using Standard Rotations
|
Larsen,
|
|
2001
|
31 |
4 |
p. 501-512
|
artikel
|
Tijdschrift beschrijving