| 1 | -- | 3 | Mario Lucertini, Giovanni Rinaldi, Antonio Sassano, Bruno Simeone. Preface |
| 5 | -- | 13 | Giovanni Andreatta, Francesco Mason. Path Covering Problems and Testing of Printed Circuits |
| 15 | -- | 34 | Ronald I. Becker, Yehoshua Perl. The Shifting Algorithm Technique for the Partitioning of Trees |
| 35 | -- | 50 | Lucio Bianco, Paolo Dell Olmo, Maria Grazia Speranza. Scheduling Independent Tasks with Multiple Modes |
| 51 | -- | 75 | Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan. Decomposability of Partially Defined Boolean Functions |
| 77 | -- | 85 | Peter Brucker. Efficient Algorithms for Some Path Partitioning Problems |
| 87 | -- | 101 | Sunil Chopra. Compositions for Matroids with the Fulkerson Property |
| 103 | -- | 117 | Michele Conforti, Gérard Cornuéjols, M. R. Rao. Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs |
| 119 | -- | 130 | Dragos Cvetkovic, Peter Rowlinson, Slobodan K. Simic. on Some Algorithmic Investigations of Star Partitions of Graphs |
| 131 | -- | 165 | Madlaine Davis-Moradkhan, Catherine Roucairol. Graph Partitioning Applied to the Logic Testing of Combinational Circuits |
| 167 | -- | 191 | Cid C. de Souza, M. Laurent. Some New Classes of Facets for the Equicut Polytope |
| 193 | -- | 208 | Reinhardt Euler, Hervé Le Verge. Complete Linear Descriptions of Small Asymmetric Traveling Salesman Polytopes |
| 209 | -- | 219 | Ali Ridha Mahjoub. A Min-max Relation for K::3::-covers in Graphs Noncontractible to K::5::e |
| 221 | -- | 248 | Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni. Partitioning a Matrix to Minimize the Maximum Cost |
| 249 | -- | 278 | Svatopluk Poljak, Franz Rendl. Solving the Max-cut Problem Using Eigenvalues |
| 279 | -- | 289 | Gottfried Tinhofer. Bin-packing and Matchings in Threshold Graphs |