nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on perfect Lee-codes over small alphabets
|
Lepistö, Timo |
|
1981 |
3 |
1 |
p. 73-74 2 p. |
artikel |
2 |
Combinatorial problems on series-parallel graphs
|
Takamizawa, K. |
|
1981 |
3 |
1 |
p. 75-76 2 p. |
artikel |
3 |
Editorial Board
|
|
|
1981 |
3 |
1 |
p. ii- 1 p. |
artikel |
4 |
“Integer-making” theorems
|
Beck, József |
|
1981 |
3 |
1 |
p. 1-8 8 p. |
artikel |
5 |
Integer programming by long division
|
Cuninghame-Green, R.A. |
|
1981 |
3 |
1 |
p. 19-25 7 p. |
artikel |
6 |
Inverted orders for monotone scoring rules
|
Fishburn, Peter C. |
|
1981 |
3 |
1 |
p. 27-36 10 p. |
artikel |
7 |
Mathematical crystal growth I
|
Klarner, D.A. |
|
1981 |
3 |
1 |
p. 47-52 6 p. |
artikel |
8 |
Optimal key for taxons ordered in accordance with their frequencies
|
Krichevskii, R.E. |
|
1981 |
3 |
1 |
p. 67-72 6 p. |
artikel |
9 |
Parametric shortest path algorithms with an application to cyclic staffing
|
Karp, Richard M. |
|
1981 |
3 |
1 |
p. 37-45 9 p. |
artikel |
10 |
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
|
Boesch, F.T. |
|
1981 |
3 |
1 |
p. 9-18 10 p. |
artikel |
11 |
Symposium on ordered sets
|
|
|
1981 |
3 |
1 |
p. 77-78 2 p. |
artikel |
12 |
Universal algorithms for evaluating boolean functions
|
Thayse, A. |
|
1981 |
3 |
1 |
p. 53-65 13 p. |
artikel |