| 123 | -- | 134 | Egon Balas. A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring |
| 135 | -- | 144 | Wolfgang W. Bein, Peter Brucker. Greedy concepts for network flow problems |
| 145 | -- | 154 | Claude Berge. New classes of perfect graphs |
| 155 | -- | 166 | Robert E. Bixby, Collette R. Coullard. On chains of 3-connected matroids |
| 167 | -- | 180 | Rainer E. Burkard. Optimal schedules for periodically recurring events |
| 181 | -- | 197 | Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth. Most and least uniform spanning trees |
| 199 | -- | 211 | Sung-Jin Chung, Katta G. Murty, Soo Y. Chang. Δ |
| 213 | -- | 220 | Maurice Cochand, Dominique de Werra. Generalized neighbourhoods and a class of perfectly orderable graphs |
| 221 | -- | 239 | Yves Crama, Peter L. Hammer, Toshihide Ibaraki. Strong unimodularity for matrices and hypergraphs |
| 241 | -- | 248 | Ulrich Derigs, Oskar Goecke, Rainer Schrader. Monge sequences and a simple assignment algorithm |
| 249 | -- | 260 | Ulrich Faigle. Exchange properties of combinatorial closure spaces |
| 261 | -- | 269 | Ulrich Faigle, Rainer Schrader. On the computational complexity of the order polynomial |
| 271 | -- | 282 | Les R. Foulds. Testing the theory of evolution: A novel application of comibinatorial optimization |
| 283 | -- | 290 | Bernhard Korte, László Lovász. Homomorphisms and Ramsey properties of antimatroids |
| 291 | -- | 313 | Eugene L. Lawler, Charles U. Martel. Polymatroidal flows with lower bounds |
| 315 | -- | 327 | Kurt Mehlhorn, Bernd H. Schmidt. On BF-orderable graphs |
| 329 | -- | 364 | F. T. Tseng, Klaus Truemper. A decomposition of the matroids with the max-flow min-cut property |
| 365 | -- | 376 | Uwe Zimmermann. Duality for balanced submodular flows |