Table Of Content

Available online at www.sciencedirect.com science @poinecr: DISCRETE APPLIED a MATHEMATICS ELSEVIER Discrete Applied Mathematics 146 (2005) 365-366 www.elsevier.com/locate/dam Author Index Volume 146 (2005) Altman, M., J. Gill, Michael and P. McDonald, Numerical Issues in Statistical Computing for the Social Scientist Amir, A. and G.M. Landau, Foreword Arikawa, S., see S. Inenaga Armstrong, D.E. and S.H. Jacobson, Data-independent neighborhood functions and strict local optima Bang-Jensen, J. and M.H. Nielsen, Finding complementary cycles in locally semicomplete digraphs Bazgan, C., R. Hassin and J. Monnot, Approximation algorithms for some vehicle routing problems Benson, G., Tandem cyclic alignment Bergeron, A., A very elementary presentation of the Hannenhalli—Pevzner theory Chartrand, G., L. Nebesky and P. Zhang, Hamiltonian colorings of graphs Corteel, S., M. Valencia-Pabon and J.-C. Vera, On approximating the b-chromatic number 106-110 Csuhaj-Varju, E. and J. Dassow, A remark on evolutionary systems 111-115 Dassow, J., see E. Csuhaj-Varju 111-115 de Werra, D., M. Demange, J. Monnot and V.Th. Paschos, A hypocoloring model for batch scheduling 3-26 Demange, M., see D. de Werra 3-26 Dolinka, I., A note on identities of two-dimensional languages 3-50 Dress, A., B. Holland, K.T. Huber, J.H. Koolen, V. Moulton and J. Weyer- Menkhoff, A additive and A ultra-additive maps, Gromovs trees, and the Farris transform 51-73 El Sahili, A., A characterization problem on underlying graphs of line digraphs 99-101 Ellen Haupt, S., see R.L. Haupt 120-120 Fraenkel, A.S. and J. Simpson, An extension of the periodicity lemma to longer periods 146-155 Georges, J.P. and D.W. Mauro, A note on collections of graphs with non-surjective lambda labelings 92-98 Gill, Michael, J., see M. Altman 117 Hassin, R., see C. Bazgan 27-42 Haupt, R.L. and S. Ellen Haupt, Practical Genetic Algorithms 120-120 Hemaspaandra, L.A. and L. Torenvliet, Theory of semi-feasible algorithms Holland, B., see A. Dress Hoshino, H., see S. Inenaga Huber, K.T., see A. Dress Inenaga, S., H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri and G. Pavesi, On-line construction of compact directed acyclic word graphs Jacobson, S.H., see D.E. Armstrong 233-243 Klein, S.T. and Y. Wiseman, Parallel Lempel Ziv coding 30-191 Koolen, J.H., see A. Dress 51-73 Kubiak, W., Minimization of ordered, symmetric half-products 287-300 Landau, G.M., see A. Amir 1234 -123 doi:10.1016/S0166-218X(04)00412- 4 366 Author Index | Discrete Applied Mathematics 146 (2005) 355-366 Leupold, P., C. Martin-Vide and V. Mitrana, Uniformly bounded duplication languages (3) 301-310 Lin, S.-S. and C.-L. Wei, Optimal algorithms for constructing knight’s tours on arbitrary n x m chessboards (3) 219-232 Lozin, V.V. and R. Mosca, Independent sets in extensions of 2K>-free graphs (1) 74-80 Martin-Vide, C., see P. Leupold (3) 301-310 Mauri, G., see S. Inenaga (2) 156-179 Mauro, D.W., see J.P. Georges (1) 92-98 McDonald, P., see M. Altman (1) 117 Meister, D., Recognition and computation of minimal triangulations for AT- ree claw-free and co-comparability graphs (3) 193-218 Mitrana, V., see P. Leupold (3) 301-310 Monnot, J., see D. de Werra (1) 3-26 Monnot, J., see C. Bazgan (1) 27-42 Mosca, R., see V.V. Lozin (1) 74-80 Moulton, V., see A. Dress (1) 51-73 Nebesky, L., see G. Chartrand (3) 257-272 Nielsen, M.H., see J. Bang-Jensen (3) 245-256 Ohtsuka, T., see T. Yamada (3) 311-342 Palbom, A., Complexity of the directed spanning cactus problem (1) 81-91 Paschos, V.Th., see D. de Werra (1) 3-26 Pavesi, G., see S. Inenaga (2) 156-179 Reed, B.A. and C.L. Sales, Recent advances in algoritms and combinatorics 118 Sales, C.L., see B.A. Reed 118 Saxena, S., see V. Yugandhar t 343-364 Schrijver, A., Combinatorial Optimization Polyhedra and Efficiency 121 Sherali, H.D. and J.C. Smith, A class of web-based facets for the generalized ve ‘tex packing problem : 3-286 Shinohara, A., see S. Inenaga 56-179 Simpson, J., see A.S. Fraenkel 155 Smith, J.C., see H.D. Sherali : 273-286 Steiner, G. and Z. Xue, The maximum traveling salesman problem on van der Veen Takeda, M., see S. Inenaga Torenvliet, L., see L.A. Hemaspaandra (1)119 Ueno, S., see T. Yamada (3) 311-342 Valencia-Pabon, M., see S. Corteel (1) 106-110 \ J.-C., see S. Corteel (1) 106-110 Watanabe, A., see T. Yamada (3) 311-342 Wei, C.-L., see S.-S. Lin (3) 219-232 Weyer-Menkhoff, J., see A. Dress (1) 51-73 Wiseman, Y., see S.T. Klein (2) 180-191 Xue, Z., see G. Steiner (1) 2 Yamada, T., T. Ohtsuka, A. Watanabe and S. Ueno, On sequential diagnosi; of multiprocessor systems (3) 311-342 Yang, S.-l., On the LU factorization of the Vandermonde matrix (1) 102-105 Yugandhar, V. and S. Saxena, Parallel algorithms for separable permutations (3) 343-364 Zhang, P., see G. Chartrand (3) 257-272