| 173 | -- | 179 | Charles E. Blair. Facial disjunctive programs and sequence of cutting-planes |
| 181 | -- | 184 | Charles J. Colbourn, Derek G. Corneil. On deciding switching equivalence of graphs |
| 185 | -- | 191 | Arthur M. Farley, Andrzej Proskurowski. Computation of the center and diameter of outerplanar graphs |
| 193 | -- | 205 | E. Ya. Gabovich, I. I. Melamed. On constant discrete programming problems |
| 207 | -- | 223 | M. Gordon, John A. Torkington. Enumeration of coloured plane trees with a given type partition |
| 225 | -- | 231 | Georg Gunther, Bert L. Hartnell. Optimal K-secure graphs |
| 233 | -- | 247 | Grzegorz Rozenberg, R. Verraedt. Synchronized and desynchronized E0L forms |
| 249 | -- | 250 | Samir K. Bhattacharya, A. K. Gupta. Occupation times for two-state Markov chains |
| 251 | -- | 254 | Fred Glover, Darwin Klingman, John Mote, David Whitman. An extended abstract of an indepth algorithmic and computational study for maximum flow problems |
| 255 | -- | 257 | Monique Hucher, Germain Sabatier, Jacques Grolier. Effectifs des diverses sequences de polyedres 3-valents convexes ayant moins de 11 faces et de polyedres sans face triangulaire ayant de 11 a 14 faces |
| 259 | -- | 260 | A. I. Riihonen. A note on perfect Lee-codes |
| 261 | -- | 265 | A. Volpentesta. Equi-assignments and explicit solutions of a particular discrete optimization problem |