| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
|
Ravi, R.
|
|
2001
|
31 |
1 |
p. 58-78
|
artikel
|
| 2 |
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
|
Ravi, R.
|
|
Inc.
|
31 |
1 |
p. 58-78
|
artikel
|
| 3 |
Geometry Helps in Bottleneck Matching and Related Problems
|
Efrat, A.
|
|
2001
|
31 |
1 |
p. 1-28
|
artikel
|
| 4 |
Geometry Helps in Bottleneck Matching and Related Problems
|
Efrat, A.
|
|
Inc.
|
31 |
1 |
p. 1-28
|
artikel
|
| 5 |
Inapproximability Results for Guarding Polygons and Terrains
|
Eidenbenz, S.
|
|
2001
|
31 |
1 |
p. 79-113
|
artikel
|
| 6 |
Inapproximability Results for Guarding Polygons and Terrains
|
Eidenbenz, S.
|
|
Inc.
|
31 |
1 |
p. 79-113
|
artikel
|
| 7 |
On-Line Competitive Algorithms for Call Admission in Optical Networks
|
Awerbuch, B.
|
|
2001
|
31 |
1 |
p. 29-43
|
artikel
|
| 8 |
On-Line Competitive Algorithms for Call Admission in Optical Networks
|
Awerbuch, B.
|
|
Inc.
|
31 |
1 |
p. 29-43
|
artikel
|
| 9 |
Permutation Routing on Reconfigurable Meshes
|
Cogolludo, J. C.
|
|
2001
|
31 |
1 |
p. 44-57
|
artikel
|
| 10 |
Permutation Routing on Reconfigurable Meshes
|
Cogolludo, J. C.
|
|
Inc.
|
31 |
1 |
p. 44-57
|
artikel
|
Tijdschrift beschrijving