nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An efficient external sorting algorithm
|
Leu, Fang-Cheng |
|
2000 |
75 |
4 |
p. 159-163 5 p. |
artikel |
2 |
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
|
Kishore, K.V.R.C.N. |
|
2000 |
75 |
4 |
p. 145-151 7 p. |
artikel |
3 |
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
|
Măndoiu, Ion I. |
|
2000 |
75 |
4 |
p. 165-167 3 p. |
artikel |
4 |
Better approximations for max TSP
|
Hassin, Refael |
|
2000 |
75 |
4 |
p. 181-186 6 p. |
artikel |
5 |
Computing Euclidean bottleneck matchings in higher dimensions
|
Efrat, Alon |
|
2000 |
75 |
4 |
p. 169-174 6 p. |
artikel |
6 |
Coverings that preserve sense of direction
|
Boldi, Paolo |
|
2000 |
75 |
4 |
p. 175-180 6 p. |
artikel |
7 |
Guarding in a simple polygon
|
Lu, Bor-Kuan |
|
2000 |
75 |
4 |
p. 153-158 6 p. |
artikel |
8 |
Simplified proof of the Fourier Sampling Theorem
|
Høyer, Peter |
|
2000 |
75 |
4 |
p. 139-143 5 p. |
artikel |