| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Generalization of a Lower Bound Technique due to Fredman and Saks
|
Ben-Amram, A. M.
|
|
2001
|
30 |
1 |
p. 34-66
|
artikel
|
| 2 |
A Generalization of a Lower Bound Technique due to Fredman and Saks
|
Ben-Amram, A. M.
|
|
Inc.
|
30 |
1 |
p. 34-66
|
artikel
|
| 3 |
Circular Separability of Polygons
|
-D. Boissonnat, J.
|
|
2001
|
30 |
1 |
p. 67-82
|
artikel
|
| 4 |
Circular Separability of Polygons
|
-D. Boissonnat, J.
|
|
Inc.
|
30 |
1 |
p. 67-82
|
artikel
|
| 5 |
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times
|
Rosenkrantz, D. J.
|
|
2001
|
30 |
1 |
p. 83-100
|
artikel
|
| 6 |
Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times
|
Rosenkrantz, D. J.
|
|
Inc.
|
30 |
1 |
p. 83-100
|
artikel
|
| 7 |
On Nonlinear Parametric Search
|
Fernández-Baca, D.
|
|
2001
|
30 |
1 |
p. 1-11
|
artikel
|
| 8 |
On Nonlinear Parametric Search
|
Fernández-Baca, D.
|
|
Inc.
|
30 |
1 |
p. 1-11
|
artikel
|
| 9 |
Optimal Edge Ranking of Trees in Linear Time
|
Lam, T. W.
|
|
2001
|
30 |
1 |
p. 12-33
|
artikel
|
| 10 |
Optimal Edge Ranking of Trees in Linear Time
|
Lam, T. W.
|
|
Inc.
|
30 |
1 |
p. 12-33
|
artikel
|
| 11 |
Optimal Search and One-Way Trading Online Algorithms
|
El-Yaniv, R.
|
|
2001
|
30 |
1 |
p. 101-139
|
artikel
|
| 12 |
Optimal Search and One-Way Trading Online Algorithms
|
El-Yaniv, R.
|
|
Inc.
|
30 |
1 |
p. 101-139
|
artikel
|
Tijdschrift beschrijving