nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear algorithm for determining the separation of convex polyhedra
|
Dobkin, David P |
|
1985 |
6 |
3 |
p. 381-392 12 p. |
artikel |
2 |
A theorem on the expected complexity of dijkstra's shortest path algorithm
|
Noshita, Kohei |
|
1985 |
6 |
3 |
p. 400-408 9 p. |
artikel |
3 |
Domination in permutation graphs
|
Farber, Martin |
|
1985 |
6 |
3 |
p. 309-321 13 p. |
artikel |
4 |
Finding the smallest triangles containing a given convex polygon
|
Klee, Victor |
|
1985 |
6 |
3 |
p. 359-375 17 p. |
artikel |
5 |
Hash table reorganization
|
Szymanski, Thomas G |
|
1985 |
6 |
3 |
p. 322-335 14 p. |
artikel |
6 |
Lower bounds for combinatorial problems on graphs
|
Nakayama, Hiroyuki |
|
1985 |
6 |
3 |
p. 393-399 7 p. |
artikel |
7 |
On the complexity of calculating factorials
|
Borwein, Peter B |
|
1985 |
6 |
3 |
p. 376-380 5 p. |
artikel |
8 |
Papers to appear in forthcoming issues
|
|
|
1985 |
6 |
3 |
p. 452-453 2 p. |
artikel |
9 |
Partitioning with two lines in the plane
|
Megiddo, Nimrod |
|
1985 |
6 |
3 |
p. 430-433 4 p. |
artikel |
10 |
Scheduling transmissions in a network
|
Itai, Alon |
|
1985 |
6 |
3 |
p. 409-429 21 p. |
artikel |
11 |
The analysis of a fringe heuristic for binary search trees
|
Poblete, Patricio V |
|
1985 |
6 |
3 |
p. 336-350 15 p. |
artikel |
12 |
The complexity of the generalised cyclic Towers of Hanoi problem
|
Er, M.C |
|
1985 |
6 |
3 |
p. 351-358 8 p. |
artikel |
13 |
The NP-completeness column: an ongoing guide
|
Johnson, David S |
|
1985 |
6 |
3 |
p. 434-451 18 p. |
artikel |