Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 61 (1995) 285 Author Index Volume 61 (1995) Abbott, H.L. and M.J. Smuga-Otto, Lower bounds for hypergraph Ramsey numbers (2) 177-180 Aigner, M. and O. Schwarzkopf, Bounds on the size of merging networks (3) 187-194 Anthony, M., Classification by polynomial surfaces (2) 91-103 Anthony, M., G. Brightwell and J. Shawe-Taylor, On specifying Boolean functions by labelled examples (1) 1- 25 Baldick, R., A unified approach to polynomially solvable cases of integer “non- separable” quadratic optimization (3) 195-212 Baumslag, M., An algebraic analysis of the connectivity of DeBruijn and shuffle- exchange digraphs (3) 213-227 Blum, M., see D.S. Cohen (2) 105-120 Brightwell, G., see M. Anthony (1) 1- 25 Chopra, S. and M.R. Rao, Facets of the k-partition polytope (1) 27- 48 Cohen, D.S. and M. Blum, On the problem of sorting burnt pancakes (2) 105-120 De Bonis, A., L. Gargano and U. Vaccaro, Optimal detection of a counterfeit coin with multi-arms balances (2) 121-131 Fellows, M., P. Hell and K. Seyffarth, Large planar graphs with given diameter and maximum degree (2) 133-153 Gargano, L., see A. De Bonis (2) 121-131 Goemans, M.X., An approximation algorithm for scheduling on three dedicated machines (1) 49-— 59 Hell, P., see M. Fellows (2) 133-153 Iwata, S. and K. Murota, A theorem on the principal structure for independent matchings (3) 229-244 Jamison, B. and S. Olariu, Linear time optimization algorithms for P4-sparse graphs (2) 155-175 Jansen, K., Scheduling of conditional executed jobs on unrelated processors (3) 245-255 Lai, H.-J., Large survivable nets and the generalized prisms (2) 181-185 Murota, K., see S. Iwata (3) 229-244 Olariu, S., see B. Jamison (2) 155-175 Paun, G. and A. Salomaa, Thin and slender languages (3) 257-270 Rao, M.R., see S. Chopra (1) 27- 48 Ravishankar, K. and S. Singh, Asymptotically optimal gossiping in ratio networks (1) 61- 82 Salomaa, A., see G. Paun (3) 257-270 Schwarzkopf, O., see M. Aigner (3) 187-194 Seyffarth, K., see M. Fellows (2) 133-153 Shawe-Taylor, J., see M. Anthony (1) l- 25 Singh, S., see K. Ravishankar (1) 61-— 82 Smuga-Otto, M.J., see H.L. Abbott (2) 177-180 Tamm, U., Deterministic communication complexity of set intersection (3) 271-283 Vaccaro, U., see A. De Bonis (2) 121-131 Vygen, J., NP-completeness of some edge-disjoint paths problems (1) 83- 90 Elsevier Science B.V.