nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A simple parallel tree contraction algorithm
|
Abrahamson, K |
|
1989 |
10 |
2 |
p. 287-302 16 p. |
artikel |
2 |
Fast algorithms for direct enclosures and direct dominances
|
Güting, Ralf-Hartmut |
|
1989 |
10 |
2 |
p. 170-186 17 p. |
artikel |
3 |
Fast parallel and serial approximate string matching
|
Landau, Gad M |
|
1989 |
10 |
2 |
p. 157-169 13 p. |
artikel |
4 |
Last-come-first-served hashing
|
Poblete, Patricio V |
|
1989 |
10 |
2 |
p. 228-248 21 p. |
artikel |
5 |
On separable clusterings
|
Heusinger, H |
|
1989 |
10 |
2 |
p. 212-227 16 p. |
artikel |
6 |
Papers to appear in forthcoming issues
|
|
|
1989 |
10 |
2 |
p. 303-304 2 p. |
artikel |
7 |
The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
|
Chiba, Norishige |
|
1989 |
10 |
2 |
p. 187-211 25 p. |
artikel |
8 |
The parallel complexity of TSP heuristics
|
Kindervater, Gerard A.P |
|
1989 |
10 |
2 |
p. 249-270 22 p. |
artikel |
9 |
Unranking and ranking spanning trees of a graph
|
Colbourn, Charles J |
|
1989 |
10 |
2 |
p. 271-286 16 p. |
artikel |