nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A heuristic triangulation algorithm
|
Plaisted, David A |
|
1987 |
8 |
3 |
p. 405-437 33 p. |
artikel |
2 |
Better expanders and superconcentrators
|
Alon, N |
|
1987 |
8 |
3 |
p. 337-347 11 p. |
artikel |
3 |
Computational complexities of diophantine equations with parameters
|
Tung, S.P |
|
1987 |
8 |
3 |
p. 324-336 13 p. |
artikel |
4 |
Fast approximation algorithms for a nonconvex covering problem
|
Hochbaum, Dorit S |
|
1987 |
8 |
3 |
p. 305-323 19 p. |
artikel |
5 |
Finding critical sets
|
Loveland, Donald W. |
|
1987 |
8 |
3 |
p. 362-371 10 p. |
artikel |
6 |
On the routability of a convex grid
|
Lai, Ten-Hwang |
|
1987 |
8 |
3 |
p. 372-384 13 p. |
artikel |
7 |
Papers to appear in forthcoming issues
|
|
|
1987 |
8 |
3 |
p. 449- 1 p. |
artikel |
8 |
Problems complete for deterministic logarithmic space
|
Cook, Stephen A |
|
1987 |
8 |
3 |
p. 385-394 10 p. |
artikel |
9 |
Space searching for intersecting objects
|
Dobkin, David P |
|
1987 |
8 |
3 |
p. 348-361 14 p. |
artikel |
10 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1987 |
8 |
3 |
p. 438-448 11 p. |
artikel |
11 |
Universal traversal sequences for paths and cycles
|
Bridgland, Michael F |
|
1987 |
8 |
3 |
p. 395-404 10 p. |
artikel |