| 109 | -- | 115 | Brian Alspach, Peter Eades, Gordon Rose. A lower-bound for the number of productions required for a certain class of languages |
| 117 | -- | 125 | Susan F. Assmann, Daniel J. Kleitman. The number of rounds needed to exchange information within a graph |
| 127 | -- | 133 | P. L. Buzytsky, G. A. Freiman. An effective formula for the number of solutions of a system of two 0, 1-equations |
| 135 | -- | 138 | A. C. Hayes, David G. Larman. The vertices of the knapsack polytope |
| 139 | -- | 147 | Renu Laskar, Douglas R. Shier. On powers and centers of chordal graphs |
| 149 | -- | 156 | Chien-Hua M. Lin, Harvey M. Salkin. An efficient algorithm for the complete set partitioning problem |
| 157 | -- | 171 | Willi Maurer. Bivalent trees and forests or upper bounds for the probability of a union revisited |
| 173 | -- | 191 | I. Morihara, T. Ibaraki, T. Hasegawa. Bin packing and multiprocessor scheduling problems with side constraint on job types |
| 193 | -- | 205 | Svatopluk Poljak, Ales Pultr, Vojtech Rödl. On qualitatively independent partitions and related problems |
| 207 | -- | 0 | Michael D. Beeler. A new Van der Waerden number |
| 209 | -- | 211 | Dietmar Dorninger, Helmut Länger. An explicit formula for the solution of the Fisher-Wright selection model in population genetics |
| 213 | -- | 214 | Manohar Lal Kaushik. Comments on "a note on Reed-Muller codes" |