Table Of Content

Discrete Applied Mathematics 39 (1992) 301-302 North-Holland Author Index Volume 39 (1992) Adams, C.M. and S.E. Tavares, Generating bent sequences (Note) (2) 155-159 Ales, J. and R. Batik, Strong elimination ordering of the total graph of a tree (Com- munication) (3) 293-295 Atallah, M.J., see J. Manning (1) 13- 35 Batik, R., see J. Ales (3) 293-295 Bjorner, A., J. Karlander and B. Lindstrom, Communication complexity of two decision problems (Note) (2) 161-163 Blanchet-Sadri, F., Games, equations, and dot-depth two monoids (2) 99-111 Chang, M.S., C.Y. Tang and R.C.T. Lee, Solving the Euclidean bottleneck bicon- nected edge subgraph problem by 2-neighborhood graphs (1) I- 12 Deogun, J.S. and G. Steiner, Hamiltonian cycle is polynomial on cocomparability graphs (Communication) (2) 165-172 Dror, M., Openshop scheduling with machine dependent processing times (3) 197-205 Fishburn, P.C., Correlation in partially ordered sets (Perspectives) (2) 173-191 Flajolet, P., D. Gardy and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search (3) 207-229 Gardy, D., see P. Flajolet (3) 207-229 Hartvigsen, D. and E. Zemel, The complexity of lifted inequalities for the knapsack problem (2) 113-123 Hwang, F.K. and G.W. Richards, The capacity of the subarray partial concentrators (3) 231-240 Ishii, S., Measure theoretic approach to the classification of cellular automata (2) 125-136 Karlander, J., see A. BjOrner (2) 161-163 Lee, R.C.T., see M7S. Chang (1) I- 12 Lindstr6m, B., see A. Bjorner (2) 161-163 Manning, J. and M.J. Atallah, Fast detection and display of symmetry in outerplanar graphs (1) 13- 35 Marathe, M.V., R. Ravi and C. Pandu Rangan, Generalized vertex covering in interval graphs (Note) (1) 87- 93 Pandu Rangan, C., see M.V. Marathe (1) 87- 93 Punnen, A.P., see M.B. Richey (2) 147-153 Rardin, R.L. and M. Sudit, Paroids: a canonical format for combinatorial optimi- zation (1) 37- 56 Ravi; R., see M.V. Marathe (1) 87- 93 Recski, A. and W. Schwarzler, One-story buildings as tensegrity frameworks III (2) 137-146 Richards, G.W., see F.K. Hwang (3) 231-240 Richey, M.B. and A.P. Punnen, Minimum perfect bipartite matchings and spanning trees under categorization (2) 147-153 Elsevier Science Publishers B.V. 302 Author Index Rothblum, U.G., H. Schneider and M.H. Schneider, Characterizations of max- balanced flows (3) 241-261 Schneider, H., see U.G. Rothblum (3) 241-261 Schneider, M.H., see U.G. Rothb!um (3) 241-261 Schwarzler, W., see A. Recski (2) 137-146 Shapiro, L., Random walks with absorbing points (1) 57- 67 Spinrad, J., P4-trees and substitution decomposition (3) 263-291 Steiner, G., see J.S. Deogun (2) 165-172 Sudit, M., see R.L. Rardin (1) 37- 56 Tang, C.Y., see M.S. Chang (1) I- 12 Tavares, S.E., see C.M. Adams (2) 155-159 Thimonier, L., see P. Flajolet (3) 207-229 Vande Vate, J.H., Structural properties of matroid matchings (1) 69- 85 Zemel, E., see D. Hartvigsen (2) 113-123