nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An optimal greedy heuristic to color interval graphs
|
Olariu, Stephan |
|
1991 |
37 |
1 |
p. 21-25 5 p. |
artikel |
2 |
Editorial board
|
|
|
1991 |
37 |
1 |
p. ii- 1 p. |
artikel |
3 |
Maximum bounded 3-dimensional matching is MAX SNP-complete
|
Kann, Viggo |
|
1991 |
37 |
1 |
p. 27-35 9 p. |
artikel |
4 |
Minimal visibility graphs
|
Campbell, Douglas |
|
1991 |
37 |
1 |
p. 49-53 5 p. |
artikel |
5 |
Multiple stack branch and bound
|
Sarkar, U.K. |
|
1991 |
37 |
1 |
p. 43-48 6 p. |
artikel |
6 |
On the minimum requirements for independent recovery in distributed systems
|
Chang, Chung-Kuo |
|
1991 |
37 |
1 |
p. 1-7 7 p. |
artikel |
7 |
Overlap closures do not suffice for termination of general term rewriting systems
|
Zhang, Xubo |
|
1991 |
37 |
1 |
p. 9-11 3 p. |
artikel |
8 |
Safety and liveness of ω-context-free languages
|
Chaudhuri, Soma |
|
1991 |
37 |
1 |
p. 13-20 8 p. |
artikel |
9 |
Seek distances in disks with two independent heads per surface
|
Manolopoulos, Yannis |
|
1991 |
37 |
1 |
p. 37-42 6 p. |
artikel |
10 |
The tree representation of the graph used in binary image processing
|
Yu, Bin |
|
1991 |
37 |
1 |
p. 55-59 5 p. |
artikel |