nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
|
Ellis, John A. |
|
1989 |
32 |
4 |
p. 199-204 6 p. |
artikel |
2 |
An efficient distributed depth-first-search algorithm
|
Sharma, Mohan B. |
|
1989 |
32 |
4 |
p. 183-186 4 p. |
artikel |
3 |
An optimal parallel algorithm for the minimum circle-cover problem
|
Atallah, Mikhail J. |
|
1989 |
32 |
4 |
p. 159-165 7 p. |
artikel |
4 |
A note on the Hamiltonian Circuit Problem on directed path graphs
|
Narasimhan, Giri |
|
1989 |
32 |
4 |
p. 167-170 4 p. |
artikel |
5 |
A note on the papadimitriou-silverberg algorithm for planning optimal piecewise-linear motion of a ladder
|
Sharir, Micha |
|
1989 |
32 |
4 |
p. 187-190 4 p. |
artikel |
6 |
Approximating the diameter of a set of points in the Euclidean space
|
Eg̃eciog̃lu, Ömer |
|
1989 |
32 |
4 |
p. 205-211 7 p. |
artikel |
7 |
On relations between intervals
|
Ligozat, Gérard |
|
1989 |
32 |
4 |
p. 177-182 6 p. |
artikel |
8 |
The demand operation in the schematic protection model
|
Sandhu, Ravinderpal Singh |
|
1989 |
32 |
4 |
p. 213-219 7 p. |
artikel |
9 |
The Steiner problem with edge lengths 1 and 2
|
Bern, Marshall |
|
1989 |
32 |
4 |
p. 171-176 6 p. |
artikel |
10 |
Voronoi diagrams with barriers and the shortest diagonal problem
|
Lingas, Andrzej |
|
1989 |
32 |
4 |
p. 191-198 8 p. |
artikel |