| 1 | -- | 24 | Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner. Open shop scheduling problems with late work criteria |
| 25 | -- | 50 | Nadia Brauner, Yves Crama. The maximum deviation just-in-time scheduling problem |
| 51 | -- | 65 | Roberto Cordone, Francesco Maffioli. On the complexity of graph tree partition problems |
| 67 | -- | 76 | Daniel Granot, Herbert Hamers. On the equivalence between some local and global Chinese postman and traveling salesman graphs |
| 77 | -- | 90 | Elena Grigorescu. The insulation sequence of a graph |
| 91 | -- | 103 | Raj Jagannathan. On polynomial complexity of a stochastic algorithm for mixed zero-one programs |
| 105 | -- | 128 | Fedor V. Fomin, Dieter Kratsch, Haiko Müller. Algorithms for graphs with small octopus |
| 129 | -- | 140 | Armen S. Asratian, Nikolai N. Kuzjurin. Two sensitivity theorems in fuzzy integer programming |
| 141 | -- | 168 | Renata Mansini, Maria Grazia Speranza, Zsolt Tuza. Scheduling groups of tasks with precedence constraints on three dedicated processors |
| 169 | -- | 192 | Kampei Miyakawa, Hiroshi Narushima. Lattice-theoretic properties of MPR-posets in phylogeny |
| 193 | -- | 212 | Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini. Lift and project relaxations for the matching and related polytopes |
| 213 | -- | 237 | Asa Packer. Polynomial-time approximation of largest simplices in V-polytopes |
| 239 | -- | 261 | Natasa Przulj, Derek G. Corneil, Ekkehard Köhler. Hereditary dominating pair graphs |
| 263 | -- | 302 | Joachim Rosenmüller, Peter Sudhölter. Cartels via the modiclus |
| 303 | -- | 316 | Akiyoshi Shioura. Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem |
| 317 | -- | 337 | Dora Giammarresi, Jean-Luc Ponty, Derick Wood, Djelloul Ziadi. A characterization of Thompson digraphs |
| 339 | -- | 350 | Heping Zhang, Rijun Zha, Haiyuan Yao. Z-transformation graphs of maximum matchings of plane bipartite graphs |
| 351 | -- | 360 | Craig A. Tovey. Non-approximability of precedence-constrained sequencing to minimize setups |