Discrete Applied Mathematics 1998: Vol 81 Index

2 Pages·1998·0.26 MB·English

DISCRETE
APPLIED
MATHEMATICS
Discrete Applied Mathematics 81 (1998) 263
Author Index
Volume 81 (1998)
Alfonsin, J.L.R., On variations of the subset sum problem i- 7
Bennett, F.E. and L. Wu, Minimum matrix representation of Sperner systems 9— 17
Blair, C., Sensitivity analysis for knapsack problems: a negative result 133-139
Cao, D. and G.L. Nemhauser, Polyhedral characterizations and perfection of line graphs 141-154
Carpi, A, On the number of Abelian square-free words on four letters 155-167
Conti, R., P. Contucci and C. Falcolini, Polynomial invariants for trees A statistical
mechanics approach 225-237
Contucci, P., see R. Conti 225-237
Falcolini, C., see R. Conti 225-237
Gibson, G.J., see C.Z.W. Hassell Sweatman 19— 39
Guan, D.J, Routing a vehicle of capacity greater than one 41— 57
Hanen, C. and A. Munier, Performance of Coffman—Graham schedules in the presence of
unit communication delays 93-108
Hassell Sweatman, C.Z.W., G.J. Gibson and B. Mulgrew, Exact classification with
two-layer neural nets in m dimensions 19— 39
Heath, L.S. and J.P.C. Vergara, Edge-packing planar graphs by cyclic graphs 169-180
Hlinény, The maximal clique and colourability of curve contact graphs 59— 68
Iwama, K. and E. Miyano, Better approximations of non-Hamiltonian graphs 239-261
Kubicka, E., G. Kubicki and O.R. Oellermann, Steiner invervals in graphs 181-190
Kubicki, G., see E. Kubicka(1—3) 181-190
Lin, R. and S. Olariu, A fast parallel algorithm to recognize P4-sparse graphs 191-215
Liu, Y., A.M organa and B. Simeone, A linear algorithm for 2-bend embeddings of planar
graphs in the two-dimensional grid 69— 91
Miyano, E., see K. Iwama 239-261
Morgana, A., see Y. Liu 69— 91
Mulgrew, B., see C.Z.W. Hassell Sweatman 19— 39
Munier, A., see C. Hanen 93-108
Nemhauser, G.L., see D. Cao 141-153
Oellermann, O.R., see E. Kubicka 181-190
Olariu, S., see Lin, R 191-215
Oxley, J. and D. Row, Panelling planar graphs 109-122
Row, D., see J. Oxley 109-122
Scutella, M.G., A strongly polynomial algorithm for the uniform balanced network flow
problem 123-131
Sierksma, G, Interchange graphs and the Hamiltonian cycle polytope 217-224
Simeone, B., see Y. Liu 69— 91
Vergara, J.P.C., see L.S. Heath 169-180
Wu, L., see F.E. Bennett 9- 17
Elsevier Science B.V.