nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
|
Bertossi, Alan A. |
|
1985 |
12 |
3 |
p. 195-201 7 p. |
artikel |
2 |
Author index
|
|
|
1985 |
12 |
3 |
p. 319-320 2 p. |
artikel |
3 |
Decreasing energy functions as a tool for studying threshold networks
|
Goles-Chacc, Eric |
|
1985 |
12 |
3 |
p. 261-277 17 p. |
artikel |
4 |
Dominating sets and domatic number of circular arc graphs
|
Bonuccelli, Maurizio A. |
|
1985 |
12 |
3 |
p. 203-213 11 p. |
artikel |
5 |
N-free posets as generalizations of series-parallel posets
|
Habib, M. |
|
1985 |
12 |
3 |
p. 279-291 13 p. |
artikel |
6 |
On the complexity of a family of generalized matching problems
|
Lai, Ten-Hwang |
|
1985 |
12 |
3 |
p. 303-318 16 p. |
artikel |
7 |
On the reduction method for integer linear programs, II
|
Elimam, A.A. |
|
1985 |
12 |
3 |
p. 241-260 20 p. |
artikel |
8 |
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes
|
Bordat, J.P. |
|
1985 |
12 |
3 |
p. 215-231 17 p. |
artikel |
9 |
The complexity of generalized clique packing
|
Corneil, D.G. |
|
1985 |
12 |
3 |
p. 233-239 7 p. |
artikel |
10 |
Universal retrieval trees
|
Krichevsky, R.E. |
|
1985 |
12 |
3 |
p. 293-302 10 p. |
artikel |