DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 76 (1997) 255 Author Index Volume 76 (1997) Bertolazzi, P., C. De Simone and A. Galluccio, A nice class for the vertex packing problem (1-3) 3-19 Blazewicz, J. and M. Drozdowski, Distributed processing of divisible jobs with communication startup costs (1-3) 21- 41 Brucker, P., J. Hurink, B. Jurisch and B. Wéstmann, A branch & bound algorithm for the open-shop problem (1-3) 43-— 59 Carlier, J., Y. Li and J.-l. Lutton, Reliability evaluation of large telecommunication networks (1-3) 61-— 80 Cochand, M., A. Gaillard and H. Groflin, Optimum partitioning into intersections of ring families (1-3) 81- 91 De Simone, C., see P. Bertolazzi (1-3) 3- 19 de Werra, D. and N.V.R. Mahadev, Preassignment requirements in chromatic scheduling (1-3) 93-101 Dell’Amico, M. and S. Martello, The k-cardinality assignment problem (1-3) 103-121 Drozdowski, M., see J. Blazewicz (1-3) 21- 41 Finke, G. and H. Jiang, A variant of the permutation flow shop model with variable processing times (1—3) 123-140 Gaillard, A., Switchdec polyhedra (1—3) 141-163 Gaillard, A., see M. Cochand (1-3) 81i- 91 Galluccio, A., see P. Bertolazzi (1-3) 3- 19 Glover, F., see E. Pesch (1-3) 165-181 Groflin, H., see M. Cochand (1-3) 81- 91 Hertz, A., On the use of Boolean methods for the computation of the stability number (1—3) 183-203 Hilton, A.J.W. and C. Zhao, Vertex-splitting and chromatic index critical graphs (1—3) 205-211 Hurink, J., see P. Brucker (1-3) 43-— 59 Jiang, H., see G. Finke (1-3) 123-140 Jurisch, B., see P. Brucker (1-3) 43- 59 Kubale, M., Open shop problem with zero—one time operations and integer release data/deadline intervals (1—3) 213-223 Li, Y., see J. Carlier (1-3) 61-— 80 Lutton, J.-l., see J. Carlier (1-3) 61— 80 Mahadev, N.V.R. and F.S. Roberts, Amenable colorings (1—3) 225-238 Mahadev, N.V.R., see D. de Werra (1-3) 93-101 Martello, S., see M. Dell’Amico (1—3) 103-121 Pesch, E. and F. Glover, TSP ejection chains (1-3) 165-181 Queyranne, M. and F.C.R. Spieksma, Approximation algorithms for multi-index transportation problems with decomposable costs (1—3) 239-253 Roberts, F.S., see N.V.R. Mahadev (1—3) 225-238 Spieksma, F.C.R., see M. Queyranne (1—3) 239-253 Wostmann, B., see P. Brucker (1-3) 43- 59 Zhao, C., see A.J.W. Hilton (1—3) 205-211 Elsevier Science B.V.