Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 100 (2000) 237-238 Author Index Volume 100 (2000) Bar-Noy, A., S. Kipnis and B. Schieber, Optimal multiple message broadcasting in telephone-like communication systems (1-2) 1- 15 Chang, G.J. and X. Zhu, Pseudo-Hamiltonian-connected graphs (3) 145-153 Damanik, D., Local symmetries in the period-doubling sequence (1-2) 115-121 Dell’Amico, M. and P. Toth, Algorithms and codes for dense assignment problems: the staotf eth e art (1-2) 17- 48 Downey, R.G., M.R. Fellows and V. Raman, The complexity of irredundasnett s parameterized by size (3) 155-167 Fellows, M.R., see R.G. Downey (3) 155-167 Fujishige, S.. A laminarity property of the polyhedron described by a _ weakly posi-modular set function (1-2) 123-126 Gavalec, M., Computing orbit period in max-min algebra (1-2) 49- 65 Granot, D., F. Granot and W.R. Zhu, Naturally submodular digraphs and forbidden digraph configurations (1-2) 67- 84 Granot, F., see D. Granot (1-2) 67- 84 Gu, Q.-P. and H. Tamaki, Multicolor routing in the undirected hypercube (3) 169-181 Guruswami, V. and C.P. Rangan, Algorithmic aspects of clique-transversal and clique-independesnett s (3) 183-202 He, Y., see C.-Y. Lee (1-2) 133-135 Kipnis, S., see A. Bar-Noy (1-2) 1- 15 Kovacs, T. and A. Lingas, Maximum packing for biconnected outerplanar graphs (1-2) 85- 94 Kravchenko, S.A., On the complexity of minimizing the number of late jobs in unit time open shop (1-2) 127-132 Lee, C.-Y., Y. He and G. Tang, A note on “parallel machine scheduling with non-simumalchtinea anvaeilaobleu tsim e” (1-2) 133-135 Lingas, A., see T. Kovacs (1-2) 85- 94 Naor, J., A. Orda and Y. Petruschka, Dynamic storage allocation with known durations (3) 203-213 Orda, A., see J. Naor (3) 203-213 Pardalos, P.M., see M.G. Resende (1-2) 95-113 Petruschka, Y., see J. Naor (3) 203-213 Pitsoulis, L.S., see M.G. Resende (1-2) 95-113 Raman, V., see R.G. Downey (3) 155-167 Rangan, C.P., see V. Guruswami (3) 183-202 Raschle, T. and K. Simon, On the P4-components of graphs (3) 215-235 Resende, M.G., L.S. Pitsoulis and P.M. Pardalos, Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (1-2) 95-113 Salazar, J.J., A note on the generalized steiner tree polytope (1-2) 137-144 Schieber, B., see A. Bar-Noy (1-2) 1- 15 Simon, K., see T. Raschle (3) 215-235 Tamaki, H., see Q.-P. Gu (3) 169-181 Tang, G., see C.-Y. Lee (1-2) 133-135 238 Author Index / Discrete Applied Mathematics 100 (2000) 237-238 Toth, P., see M. Dell’Amico (1-2) 17- 48 Zhu, W.R., see D. Granot (1-2) 67- 84 Zhu, X., see G.J. Chang (3) 145-153