| 227 | -- | 233 | Jin Akiyama, David Avis, Vasek Chvátal, Hiroshi Era. Balancing signed graphs |
| 235 | -- | 255 | Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt. Basic formulas and languages Part I. The theory |
| 257 | -- | 262 | Aviezri S. Fraenkel. in≤2 are NP-complete |
| 263 | -- | 273 | Hiroaki Ishii, Shogo Shiode, Toshio Nishida, Yoshikazu Namasuya. Stochastic spanning tree problem |
| 275 | -- | 288 | Silvano Martello, Paolo Toth. A Bound and Bound algorithm for the zero-one multiple knapsack problem |
| 289 | -- | 299 | Hermann A. Maurer, Arto Salomaa, Derick Wood. Decidability and density in two-symbol grammar forms |
| 301 | -- | 312 | Svatopluk Poljak, Vojtech Rödl, Daniel Turzík. Complexity of representation of graphs by set systems |
| 313 | -- | 318 | George Gens, Eugene Levner. Fast approximation algorithm for job sequencing with deadlines |
| 319 | -- | 322 | Grzegorz Rozenberg, Arto Salomaa. Table systems with unconditional transfer |