| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Near-Linear Area Bound for Drawing Binary Trees
|
Chan,
|
|
Inc.
|
34 |
1 |
p. 1-13
|
artikel
|
| 2 |
A Near-Linear Area Bound for Drawing Binary Trees
|
Chan,
|
|
2002
|
34 |
1 |
p. 1-13
|
artikel
|
| 3 |
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
|
Ravi,
|
|
Inc.
|
34 |
1 |
p. 98-107
|
artikel
|
| 4 |
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
|
Ravi,
|
|
2002
|
34 |
1 |
p. 98-107
|
artikel
|
| 5 |
Pinwheel Scheduling: Achievable Densities
|
Fishburn,
|
|
Inc.
|
34 |
1 |
p. 14-38
|
artikel
|
| 6 |
Pinwheel Scheduling: Achievable Densities
|
Fishburn,
|
|
2002
|
34 |
1 |
p. 14-38
|
artikel
|
| 7 |
Realistic Input Models for Geometric Algorithms
|
de Berg,
|
|
Inc.
|
34 |
1 |
p. 81-97
|
artikel
|
| 8 |
Realistic Input Models for Geometric Algorithms
|
de Berg,
|
|
2002
|
34 |
1 |
p. 81-97
|
artikel
|
| 9 |
Splitting a Delaunay Triangulation in Linear Time
|
Chazelle,
|
|
Inc.
|
34 |
1 |
p. 39-46
|
artikel
|
| 10 |
Splitting a Delaunay Triangulation in Linear Time
|
Chazelle,
|
|
2002
|
34 |
1 |
p. 39-46
|
artikel
|
| 11 |
Testing and Spot-Checking of Data Streams
|
Feigenbaum,
|
|
Inc.
|
34 |
1 |
p. 67-80
|
artikel
|
| 12 |
Testing and Spot-Checking of Data Streams
|
Feigenbaum,
|
|
2002
|
34 |
1 |
p. 67-80
|
artikel
|
| 13 |
The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help
|
Jansen,
|
|
Inc.
|
34 |
1 |
p. 47-66
|
artikel
|
| 14 |
The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help
|
Jansen,
|
|
2002
|
34 |
1 |
p. 47-66
|
artikel
|
Tijdschrift beschrijving