Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 108 (2001) 335-336 Author Index Volume 108 (2001) Anstreicher, K.M., M. Fampa, J. Lee and J. Williams, Maximum-entropy remote samp- ling 3) 211-226 Brandstadt, A. and V.V. Lozin, A note on «-redundant vertices in graphs (3) 301-308 Butler, J.T., G.‘W. Dueck, S.N. Yanushkevich and V.P. Shmerko, On the number of generators for transeunt triangles 309-316 Cicerone, S. and G. Stefano, Graphs with bounded induced distance Courcelle, B., JA. Makowsky and U. Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic Damaschke, P., Minus domination in small-degree graphs de Figueiredo, C.M.H., see L. Faria 65- 83 Dueck, G.W., see J.T. Butler 309-316 Fampa, M., see K.M. Anstreicher 211-226 Faria, L., C.M.H. de Figueiredo and C.F.X. Mendonca, SPLITTING NUMBER is NP- complete 65- 83 Fekete, S.P. and J. Kremer, Tree spanners in planar graphs 85-103 Han, Y., W. Liang and X. Shen, Very fast parallel algorithms for approximate edge coloring Handke, D., Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees Hanen, C. and A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays Kern, W. and D. Paulusma, The new FIFA rules are hard: complexity aspects of sports competitions Kranakis, E., D. Krizanc, A. Maheshwari, J.-R. Sack and J. Urrutia, Ray shooting from convex ranges 259-267 Kremer, J., see S. Fekete 85-103 Krizanc, D., see E. Kranakis 259-267 Krumke, S.0., M.V. Marathe, H. Noltemeier, S.S. Ravi and H.-C. Wirth, Upgrading bottleneck constrained forests 129-142 Lee, J. and D. Wilson, Polyhedral methods for piecewise-linear functions I: the lambda method 269-285 Lee, J., see K.M. Anstreicher 211-226 Liang, W., see Y. Han 227-238 Lozin, V.V., see A. Brandstadt 301-308 Maheshwari, A., see E. Kranakis 259-267 Makowsky, J.A., see B. Courcelle 23- 52 Marathe, M.V., see S.O. Krumke 129-142 Mendonga, C.F.X., see L. Faria 65- 83 Mitrana, V. and R. Stiebe, Extended finite automata over groups 287-300 Munier, A., see C. Hanen 239-257 Noltemeier, H., see S.O. Krumke 129-142 Paulusma, D., see W. Kern 317-323 Ravi, S.S., see $.O. Krumke 129-142 Rotics, U., see B. Courcelle 23- 52 Elsevier Science B.V. 336 Author Index / Discrete Applied Mathematics 108 (2001) 335-336 R6ttger, M. and U.-P. Schroeder, Efficient embeddings of grids into grids (1-2) 143-173 Sack, J.-R., see E. Kranakis (3) 259-267 Schroeder, U.-P., see M. ROttger (1-2) 143-173 Shahrokhi, F. and L.A. Székely, Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem (1-2) 175-191 Shen, X., see Y. Han (3) 227-238 Shmerko, V.P., see J.T. Butler (3) 309-316 Stefano, G., see S. Cicerone (1-2) 3- 21 Stiebe, R., see V. Mitrana (3) 287-300 Szekely, L.A., see F. Shahrokhi (1-2) 175-191 Talamo, M. and P. Vocca, Representing graphs implicitly using almost optimal space (1-2) 193-210 UrrutiJa.,, s ee E. Kranakis (3) 259-267 Vocca, P., see M. Talamo (1-2) 193-210 Williams, J., see K.M. Anstreicher (3) 211-226 Wilson, D., see J. Lee (3) 269-285 Wirth, H.-C., see S.O. Krumke (1-2) 129-142 Woeginger, G.J., A note on the depth function of combinatorial optimization problems (3) 325-328 Yanushkevich, S.N., see J.T. Butler (3) 309-316 Zhang, G., An on-line bin-batching problem (3) 329-333 is S=aa ret