Discrete Applied Mathematics, Volume 94

Volume 94, Number 1-3, May 1999

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