Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 127 (2003) 691-693 Author Index Volume 127 (2003) Akutsu, T., K. Kanaya, A. Ohyama and A. Fujiyama, Point matching under non-uniform distortions 5S— 21 Albert, D., see S. Brandt 221-239 Aleskerov, F. and Y. Masatlioglu, Utility representation via additive or multiplicative error functions 181-197 Aneja, Y.P., R. Chandrasekaran and K.P.K. Nair, Parametric min-cuts analysis in a network 679-689 Anil Kumar, V.S., see V. Chandru 145-161 Averbakh, I., Complexity of robust single facility location problems on networks with uncertain edge lengths 505-522 Bajaj, C.L., V. Pascucci, A. Shamir, R.J. Holt and A.N. Netravali, Dynamic maintenance and visualization of molecular surfaces 23- 51 Bang Le, V., Bipartite-perfect graphs 581-599 Berman, P., see V. Veeramachaneni 119-143 Bermond, J.-C., J. Bond, D. Peleg and S. Perennes, The power of small coalitions in graphs 399-414 Bertrand, P. and M.F. Janowitz, The k-weak hierarchical representations: an extension of the indexed closed weak hierarchies 199-220 Bond, J., see J.-C. Bermond 399-414 Brandt, S., D. Albert and C. Hockemeyer, Surmise relations between tests—mathematical considerations 221-239 Bruni, R. and A. Sassano, A complete adaptive algorithm for propositional satisfiability 523-534 Budinich, M., Exact bounds on the order of the maximum clique of a graph 535-543 Cai, L., Parameterized complexity of vertex colouring 415-429 Cai, M., see Q. Fang 555-563 Caspard, N. and B. Monjardet, The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey 241-269 Chandrasekaran, R., see Y.P. Aneja 679-689 Chandru, V., A. DattaSharma and V.S. Anil Kumar, The algorithmics of folding proteins on lattices 145-161 Chen, Y. and F. Tian, A new proof of Wojcicka’s conjecture 545-554 Damaschke, P., Point placement on the line by distance data 53- 62 DattaSharma, A., see V. Chandru 145-161 Deng, X., see Q. Fang 555-563 Denis, F. and O. Gascuel, On the consistency of the minimum evolution principle of phylogenetic inference 63— 77 Diday, E. and R. Emilion, Maximal and stochastic Galois lattices 271-284 Emilion, R., see E. Diday 271-284 Fang, Q., M. Cai and X. Deng, Total balancedness condition for Steiner tree games 555-563 Farley, A.M., see S. Fujita 431-446 Feige, U., R. Krauthgamer and K. Nissim, On cutting a few vertices from a graph 643-649 Fomin, F.V., D. Kratsch and H. Miiller, On the domination search number 565-580 PII: S0166-218X(03)00253-1 692 Author Index | Discrete Applied Mathematics 127 (2003) 691-693 Fujita, S. and A.M. Farley, Sparse Hypercube—a minimal k-line broadcast graph 431-446 Fujiyama, A., see T. Akutsu > 21 Gascuel,O. , see F. Denis 63— 77 Gavalec, M. and J. Plavka, An O(n>) algorithm for maximum cycle mean of Monge matrices in max-algebra 651-656 Heun, V., Approximate protein folding in the HP side chain model on extended cubic lattices 163-177 Hockemeyer, C., see S. Brandt 221-239 Holt, R.J., see C.L. Bajaj 23— 51 Istrail, S., P. Pevzner and R. Shamir, Preface l- 3 Janowitz, M.F., Preface 179-180 Janowitz, M.F., see P. Bertrand 199-220 Kanaya, K., see T. Akutsu > 2i Kratsch, D., see F.V. Fomin 565-580 Krauthgamer, R., see U. Feige 643-649 Laguna, M., see R. Marti 665-678 Leclerc, B., The median procedure in the semilattice of orders 285-302 Leischner, L., Additive similarity measures 303-318 Marti, R. and M. Laguna, Heuristics and meta-heuristics for 2-layer straight line crossing minimization 665-678 Masatlioglu, Y., see F. Aleskerov 181-197 McMorris, F.R., H.M. Mulder and R.C. Powers, The median function on 319-324 distributive semilattices 601-613 Meng, Jixiang, Connectivity of vertex and edge transitive graphs 447-460 Michael, T.S. and T. Quint, Sphere of influence graphs and the L.,-metric Miklos, I., Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution 79— 84 Miller, W., see V. Veeramachaneni 119-143 Monjardet, B., see N. Caspard 241—269 Moukrim, A., Scheduling unitary task systems with zero—one communication delays for quasi-interval orders 461-476 Mulder, H.M., see F.R. McMorris 319-324 Miller, H., see F.V. Fomin 565-580 Nair, K.P.K., see Y.P. Aneja 679-689 Netravali, A.N., see C.L. Bajaj 23— 51 Nissim, K., see U. Feige 643-649 Ohyama, A., see T. Akutsu 5- 21 Pascucci, V., see C.L. Bajaj 23— 51 Pavlovic, L., Maximal value of the zeroth-order Randic index 615-626 Peleg, D., see J.-C. Bermond 399-414 Pendavingh, R., P. Schuurman and G.J. Woeginger, Recognizing DNA graphs is difficult 85— 94 Perennes, S., see J.-C. Bermond 399-414 Pevzner, P., see S. Istrail l- 3 Plavka, J., see M. Gavalec 651-656 Powers, R.C., Medians and majorities in semimodular posets 325-336 Powers, R.C., see F.R. McMorris 319-324 Prediger, S., Formal Concept Analysis for general objects 337-355 Quint, T., see T.S. Michael 447-460 Roberts, F.S. and S. Xu, Characterizations of consistent marked graphs 357-371 Salavatipour, M.R., On sum coloring of graphs 477-488 Sassano, A., see R. Bruni 523-534 Schuurman, P., see R. Pendavingh 85— 94 Schwikowski, B. and M. Vingron, Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions 95-117 Semple, C., Reconstructing minimal rooted trees 489-503 Author Index | Discrete Applied Mathematics 127 (2003) 691-693 693 Shamir, A., see C.L. Bajaj 23—- Sl Shamir, R., see S. Istrail l- 3 Suck, R., Parsimonious set representations of orders, a generalization of the interval order concept, and knowledge spaces 373-386 Tian, F., see Y. Chen 545-554 Tsaban, B., Bernoulli numbers and the probability of a birthday surprise 657-663 Tsoukias, A. and Ph. Vincke, A characterization of PQ/ interval orders 387-397 Veeramachaneni, V., P. Berman and W. Miller, Aligning two fragmented sequences 119-143 Vincke, Ph., see A. Tsoukias 387-397 Vingron, M., see B. Schwikowski 95-117 Woeginger, G.J., see R. Pendavingh 85— 94 Xu, S., see F.S. Roberts 357-371 Yeh, Y.T. and S.S. Yu, The disjunctivities of w-languages 627-641 Yu, S.S., see Y.T. Yeh 627-641