| 1 | -- | 0 | Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer. Preface |
| 3 | -- | 7 | Alain Hertz. On Perfect Switching Classes |
| 9 | -- | 33 | Vincent Barré, Jean-Luc Fouquet. On Minimal Imperfect Graphs Without Induced P::5:: |
| 35 | -- | 50 | Jacek Blazewicz, Maciej Drozdowski, Frédéric Guinand, Denis Trystram. Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh |
| 51 | -- | 76 | Jean Paul Boufflet, Jacques Carlier. An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System |
| 77 | -- | 99 | Peter Brucker, Thomas Hilbig, Johann Hurink. A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags |
| 101 | -- | 139 | Rachid Chérifi, Sylvain Gravier, Xavier Lagraula, Charles Payan, Ismaïl Zighem. Domination Number of the Cross Product of Paths |
| 141 | -- | 159 | Philippe Chrétienne. List Schedules for Cyclic Scheduling |
| 161 | -- | 169 | Caterina De Simone, János Körner. On the Odd Cycles of Normal Graphs |
| 171 | -- | 180 | Dominique de Werra. On a Multiconstrained Model for Chromatic Scheduling |
| 181 | -- | 191 | Paolo Dell Olmo, Maria Grazia Speranza. Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size |
| 193 | -- | 203 | Krzysztof Giaro, Marek Kubale, Michal Malafiejski. On the Deficiency of Bipartite Graphs |
| 205 | -- | 225 | Pierre Hansen, Brigitte Jaumard, Christophe Meyer. On Lower Bounds for Numbered Complete Graphs |
| 227 | -- | 245 | Anthony J. W. Hilton, Peter D. Johnson Jr.. The Hall Number, the Hall Index, and the Total Hall Number of a Graph |
| 247 | -- | 262 | Chính T. Hoàng. On the Disc-structure of Perfect Graphs I the Co-paw-structure |
| 263 | -- | 285 | Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz. Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs |
| 287 | -- | 296 | Frédéric Maffray, Myriam Preissmann. Sequential Colorings and Perfect Graphs |
| 297 | -- | 319 | Nicolas Moeri. A Technique to Find Multiple Motif Occurrences in a Biomolecular Sequence |
| 321 | -- | 328 | Erich Prisner, Jayme Luiz Szwarcfiter. Recognizing Clique Graphs of Directed and Rooted Path Graphs |
| 329 | -- | 336 | Irena Rusu. P::4::-domination in Minimal Imperfect Graphs |