| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A linear algorithm for finding the convex hull of a simple polygon
|
McCallum, Duncan
|
|
1979
|
9 |
5 |
p. 201-206
6 p.
|
artikel
|
| 2 |
A note on simplification orderings
|
Dershowitz, Nachum
|
|
1979
|
9 |
5 |
p. 212-215
4 p.
|
artikel
|
| 3 |
Another efficient algorithm for convex hulls in two dimensions
|
Andrew, A.M.
|
|
1979
|
9 |
5 |
p. 216-219
4 p.
|
artikel
|
| 4 |
Author index
|
|
|
1979
|
9 |
5 |
p. 238-239
2 p.
|
artikel
|
| 5 |
Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints
|
Słowiński, Roman
|
|
1979
|
9 |
5 |
p. 233-237
5 p.
|
artikel
|
| 6 |
Cyclomatic numbers do not measure complexity of unstructured programs
|
Oulsnam, G.
|
|
1979
|
9 |
5 |
p. 207-211
5 p.
|
artikel
|
| 7 |
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
|
Mitchell, Sandra L.
|
|
1979
|
9 |
5 |
p. 229-232
4 p.
|
artikel
|
| 8 |
Systems of distinct representatives for k families of sets
|
Szwarcfiter, Jayme Luiz
|
|
1979
|
9 |
5 |
p. 195-196
2 p.
|
artikel
|
| 9 |
The emptiness of complement problem for semi extended regular expressions requires cn space
|
Robson, J.M.
|
|
1979
|
9 |
5 |
p. 220-222
3 p.
|
artikel
|
| 10 |
Traversing binary trees simply and cheaply
|
Morris, Joseph M.
|
|
1979
|
9 |
5 |
p. 197-200
4 p.
|
artikel
|
| 11 |
Voronoi diagrams from convex hulls
|
Brown, Kevin Q.
|
|
1979
|
9 |
5 |
p. 223-228
6 p.
|
artikel
|
Tijdschrift beschrijving