Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 118 (2002) 323-324 Author Index Volume 118 (2002) Amaldi, E. and M. Mattavelli, The MIN PFS problem and piecewise linear model estimation (1-2) 115-143 Anbil, R., see F. Barahona (l-2) 3-11 Barahona, F. and R. Anbil, On some difficult linear programs coming from set partitioning (1-2) 3-11 Becker, R.I., Y.I. Chang, I. Lari, A. Scozzari and G. Storchi, Finding the /--core of a tree (1-2) 25— 42 Berman, K.A. and J.L. Paul, Verifiable broadcasting and gossiping in communication networks (3) 293-298 Chang, Y.I., see R.I. Becker (1-2) 25-42 Cheng, E. and M.J. Lipman, Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness (3) 163-179 Dell’Amico, M., S. Martello and D. Vigo, A lower bound for the non-oriented two- dimensional bin packing problem (1-2) 13-24 Fernandez-Baca, D., T. Seppaldinen and G. Slutzki, Bounds for parametric sequence comparison (3) 181-198 Fujito, T. and H. Nagamochi, A 2-approximation algorithm for the minimum weight edge dominating set problem (3) 199-207 Galbiati, G., On the approximation of the Minimum Disturbance p-Facility Location Problem (1-2) 73-83 Gartner, J., see N. Musliu (1-2) 85-98 Guo, X., P. Hansen and M. Zheng, Boundary uniqueness of fusenes (3) 209-222 Hamacher, H.W. and K.-H. Kafer, Inverse radiation therapy planning — a multiple objective optimization approach (1-2) 145-161 Hansen, P., see X. Guo (3) 209-222 Hosono, K. and K. Matsuda, On the perfect matching of disjoint compact sets by noncrossing line segments in FR" (3) 223-238 Jaumard, B., O. Marcotte, C. Meyer and T. Vovor, Erratum to “Comparison of column generation models for channel assignment in cellular networks” [Discrete Appl. Math. 112 (2001) 217-240] (3) 299-322 Kiifer, K.-H., see H.W. Hamacher (1-2) 145-161 Kinoshita, H., see T. Yamada (3) 279-291 Lari, I., see R.I. Becker (1-2) 25-42 Lipman, M.J., see E. Cheng (3) 163-179 Maioli, F., see F. Malucelli (1-2) I- 2 Mahdian, M., On the computational complexity of strong edge coloring (3) 239-248 Malucelli, F. and F. Maioli, Preface (I-2) I- 2 Marcotte, O., see B. Jaumard (3) 299-322 Martello, S., see M. Dell’Amico (1-2) 13-24 Matsuda, K., see K. Hosono (3) 223-238 Mattavelli, M., see E. Amaldi (1-2) 115-143 Meyer, C., see B. Jaumard (3) 299-322 Musliu, N., J. Gartner and W. Slany, Eicient generation of rotating workforce schedules (1-2) 85-98 PII: S0166-218X(02)00174-9 324 Author Index Discrete Applied Mathematics 118 (2002) 323-324 Nagamochi, H., see T. Fujito (3) 199-207 Neudauer, N.A., Graph representations of a bicircular matroid (3) 249-262 Nicosia, G., D. Pacciarelli and A. Pacifici, Optimally balancing assembly lines with dierent workstations (1-2) 99-113 Nielsen, J., see P. Winter (I-2) 55-72 Pacciarelli, D., see G. Nicosia (1-2) 99-113 Pacifici, A., see G. Nicosia (1-2) 99-113 Paul, J.L., see K.A. Berman (3) 293-298 Peérez-Brito, D., see A. Tamir (3) 263-278 Puerto, J., see A. Tamir (3) 263-278 Ribeiro, C.C. and M.C. Souza, Variable neighborhood search for the degree-constrained minimum spanning tree problem (1-2) 43-54 Scozzari, A., see R.I. Becker (1-2) 25-42 SeppaTl., iseei D.i Fnerneandnez-,Bac a (3) 181-198 Slany, W., see N. Musliu (1-2) 85-98 Slutzki, G., see D. Fernandez-Baca (3) 181-198 Souza, M.C., see C.C. Ribeiro (1-2) 43-54 Storchi, G., see R.I. Becker (1-2) 25-42 Tamir, A., J. Puerto and D. Pérez-Brito, The centdian subtree on tree networks (3) 263-278 Vigo, D., see M. Dell’Amico (1-2) 13-24 Vovor, T., see B. Jaumard (3) 299-322 Winter, P.. M. Zachariasen and J. Nielsen, Short trees in polygons (I-2) 55-72 Yamada, T. and H. Kinoshita, Finding all the negative cycles in a directed graph (3) 279-291 Zachariasen, M., see P. Winter (1-2) 55-72 Zheng, M., see X. Guo (3) 209-222