| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Achromatic number is NP-complete for cographs and interval graphs
|
Bodlaender, Hans L.
|
|
1989
|
31 |
3 |
p. 135-138
4 p.
|
artikel
|
| 2 |
An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs
|
Shih, Wei-Kuan
|
|
1989
|
31 |
3 |
p. 129-134
6 p.
|
artikel
|
| 3 |
Asymptotic evaluation of window visibility
|
Matsuoka, Satoshi
|
|
1989
|
31 |
3 |
p. 119-126
8 p.
|
artikel
|
| 4 |
Bin packing with restricted piece sizes
|
Leung, Joseph Y-T.
|
|
1989
|
31 |
3 |
p. 145-149
5 p.
|
artikel
|
| 5 |
Characterization of idempotent transformation monoids
|
Beaudry, Martin
|
|
1989
|
31 |
3 |
p. 163-166
4 p.
|
artikel
|
| 6 |
Comments on “ring based termination detection algorithm for distributed computations”
|
Tel, G.
|
|
1989
|
31 |
3 |
p. 127-128
2 p.
|
artikel
|
| 7 |
Data structures in a real-time environment
|
Lentfert, Patrick
|
|
1989
|
31 |
3 |
p. 151-155
5 p.
|
artikel
|
| 8 |
On the use of random numbers in asynchronous simulation via rollback
|
Tsitsiklis, John N.
|
|
1989
|
31 |
3 |
p. 139-144
6 p.
|
artikel
|
| 9 |
Parallel parsing on the connection machine
|
Skillicorn, D.B.
|
|
1989
|
31 |
3 |
p. 111-117
7 p.
|
artikel
|
| 10 |
The parallel complexity of finding a blocking flow in a 3-layer network
|
Cheriyan, J.
|
|
1989
|
31 |
3 |
p. 157-161
5 p.
|
artikel
|
Tijdschrift beschrijving