Table Of Content

DISCRETE APPLIED MATHEMATICS Discrete Applied Mathematics 75 (1997) 297—298 Author Index Volume 75 (1997) Aneja, Y.P., see A.P. Punnen (1) 93-102 Averbakh, I. and O. Berman, (p — 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective (3) 201-216 Berman, O., see I. Averbakh (3) 201-216 Bollobas, B. and I. Leader, Matchings and paths in the cube (1) 1- 8 Brown, T.J.N., R.B. Mallion, P. Pollak and A. Roth, Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes [Discrete Applied Mathematics 67 (1996) 51—66] (2) 199-200 Chen, Z.-L., Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81—93] (1) 103 Choi, H., see S.-K. Lee (1) 81- 91 Choi, H.-A., see S.-K. Lee (1) 81- 91 Crama, Y., O. Ekin and P.L. Hammer, Variable and term removal from Boolean formulae (3) 217-230 De Prisco, R. and A. De Santis, Catastrophic faults in reconfigurable systolic linear arrays (2) 105—123 De Santis, A., see R. De Prisco (2) 105—123 Dean, A.M. and J.P. Hutchinson, Rectangle-visibility representations of bipartite graphs (1) 9- 25 Ekin, O., see Y. Crama (3) 217-230 Fagnot, I., On the subword equivalence problem for morphic words (3) 231-253 Farley, A.M., see S. Fujita (3) 255-268 Firby, P. and J. Haviland, Independence and average distance in graphs (1) 27- 37 Fishburn, P., P. Schwander, L. Shepp and R.J. Vanderbei, The discrete Radon transform and its approximate inversion via linear programming (1) 39- 61 Fujita, S. and A.M. Farley, Minimum-cost line broadcast in paths (3) 255—268 Garcia, C. and C. Peyrat, Large Cayley graphs on an abelian group (2) 125-133 Gavalec, M., Computing matrix period in max—min algebra (1) 63— 70 Gorodkin, J., Orbits of Boolean functions (3) 269-275 Hammer, P.L., see Y. Crama (3) 217—230 Haviland, J., see P. Firby (1) 27- 37 Hutchinson, J.P., see A.M. Dean (1) 9- 25 Jansen, K., and P. Scheffler, Generalized coloring for tree-like graphs (2) 135-155 Kranakis, E., D. Krizanc, A.M aheshwari, M. Noy, J.-R. Sack and J. Urrutia, Stage-graph representations (1) 71-— 80 Krizanc, D., see E. Kranakis (1) 71-— 80 Labahn, R. and A. Raspaud, Periodic gossiping in back-to-back trees (2) 157—168 Leader, I., see B. Bollobas (1) 1- 8 Lee, S.-K., A.D. Oh, H. Choi and H.-A. Choi, Optimal transmission schedules in TWDM optical passive star networks (1) 81- 91 Maheshwari, A., see E. Kranakis (1) 71-— 80 Mallion, R.B., see T.J.N. Brown (2) 199-200 Elsevier Science B.V. 298 Discrete Applied Mathematics 75 (1997) 297-298 Martello, S., F. Soumis and P. Toth, Exact and approximation algorithms for makespan minimization on unrelated parallel machines (2) 169-188 Noy, M., see E. Kranakis (1) 71— 80 Oh, A.D., see S.-K. Lee (1) 81— 91 Peyrat, C., see C. Garcia (2) 125—133 Pollak, P., see T.J.N. Brown (2) 199-200 Punnen, A.P. and Y.P. Aneja, Minimum dispersion problems (1) 93—102 Raspaud, A., see R. Labahn (2) 157-168 Roditty, Y. and B. Shoham, On broadcasting multiple messages in a d-dimensional grid (3) 277-284 Roth, A., see T.J.N. Brown (2) 199-200 Sack, J.-R., see E. Kranakis (1) 71— 80 Scheffler, P., see K. Jansen (2) 135—155 Schwander, P., see P. Fishburn (1) 39— 61 Scott, A.D., Better bounds for perpetual gossiping (2) 189-197 ShepLp.,, s ee P. Fishburn (1) 39— 61 Shoham, B., see Y. Roditty (3) 277-284 Soumis, F., see S$. Martello (2) 169-188 Stivaros, C. and K. Sutner, Computing optimal assignments for residual network reliability (3) 285-295 Sutner, K., see C. Stivaros (3) 285-295 Toth, P., see S. Martello (2) 169-188 Urrutia, J., see E. Kranakis (1) 71— 80 Vanderbei, R.J., see P. Fishburn (1) 39— 61