Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 68 (1996) 305-306 Author Index Volume 68 (1996) Aldershof, B. and O.M. Carducci, Stable matchings with couples Ando, K., S. Fujishige and T. Nemoto, Decomposition of a bidirected graph into strongly connected components and its signed poset structure Averbakh, I. and O. Berman, A heuristic with worst-case analysis for minimax routing of two travelling salesman on a tree Beineke, L.W., O.R. Oellermann and R.E. Pippert, On the Steiner median of a tree Berman, O., see 1.A verbakh Bermond, J.-C. and F.O. Ergincan, Bus interconnection networks Blanchet-Sadri, F., Inclusion relations between some congruences related to the dot-depth hierarchy Carducci, O.M., see B. Aldershof de Werra, D., A.J. Hoffman, N.V.R. Mahadev and U.N. Peled, Restrictions and preassignments in preemptive open shop scheduling Dragan, F.F. and V.I. Voloshin, Incidence graphs of biacyclic hypergraphs Dunbar, J.. W. Goddard, S. Hedetniemi, A. McRae and M.A. Henning, The algo- rithmic complexity of minus domination in graphs Ergincan, F.O., see J.-C. Bermon Fishburn, P.C., Decision theory and discrete mathematics Fricke, G.H., M.A. Henning, O.R. Oellermann and H.C. Swart, An algorithm to find two distance domination parameters in a graph Fricke, G.H., S.T. Hedetniemi and D.P. Jacobs, Maximal irredundant functions Fuyishige, S., see K. Ando Goddard, W., see J. Dunbar Hedetniemi, S., see J.D unbar Hedetniemi, S.T., see G.H. Fricke Henning, M.A., see J. Dunbar Henning, M.A., see G.H. Fricke Hoffman, A.J., see D. de Werra Jacobs, D.P., see G.H. Fricke Klavzar, S. and J. Zerovnik, Algebraic approach to fascialgraphs and rotagraphs Lee, Y., see H.D. Sherali Lee, C.-Y. and C.-L. Li, On the fixed interval due-date scheduling problem Li, C.-L., see C.-Y. Lee Liestman, A.L., T.C. Shermer and C.R. Stolte, Degree-constrained spanners for multidimensional grids 306 Discrete Applied Mathematics 68 (1996) 305—306 Manoussakis, Y. and Z. Tuza, The forwarding index of directed networks McRae, A., see J. Dunbar Nemoto, T., see K. Ando Oellermann, O.R., see G.H. Fricke Oellermann, O.R., see L.W. Beineke Pandu Rangan C., see C.R. Satyan Peled, U.N., see D. de Werra Pippert, R.E., see L.W. Beineke Popescu, D.R. and |. Tomescu, Negative cycles in complete signed graphs Satyan, C.R. and C. Pandu Rangan, The parity path problems on some subclasses of perfect graphs Sherali, H.D. and Y. Lee, Tighter representations for set partitioning problems Shermer, T.C., see A.L. Liestman Stewart, 1.A., Finding regular subgraphs in both arbitrary and planar graphs Stolte, C.R., see A.L. Liestman Swart, H.C., see G.H. Fricke Tomescu, I., see D.R. Popescu Tuza, Z., see Y. Manoussakis Voloshin, V.1., see F.F. Dragan Yu, W., Augmentations of consistent partial orders for the one-machine total tardiness problem Zerovnik, J., see S. Klavzar