Table Of Content

DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 110 (2001) 327-328 Author Index Volume 110 (2001) Albers, S. and G. Schmidt, Scheduling with unexpected machine breakdowns (2-3) 85- 99 Battati, R., A. Bertossi and S. Martello, Editorial (1) 1 Bertoni, A., P. Campadelli and G. Grossi, An approximation algorithm for the maximum cut problem and its experimental analysis (1) 3- 12 Bertossi, A., see R. Battati (1) 1 Bezrukov, S.L., Embedding complete trees into the hypercube (2-3) 101-119 Bonizzoni, P., G.D. Vedova and G. Mauri, Experimenting an approximation algorithm for the LCS (1) 13- 24 Campadelli, P., see A. Bertoni (I) 3- 12 Cechlarova, K. and V. Lacko, Persistency in combinatorial optimization problems on matroids (2-3) 121-132 Chen, B., D. Du, J. Han and J. Wen, On-line scheduling of small open shops (2-3) 133-150 Chen, D.Z., G. Das and M. Smid, Lower bounds for computing geometric spanners and approximate shortest paths (2-3) 151-167 Das, G., see D.Z. Chen (2-3) 151-167 Dell’Amico, M., A. Lodi and S. Martello, Efficient algorithms and codes for k-cardinality assignment problems (1) 25- 40 Du, D., see B. Chen (2-3) 133-150 Galli, N., B. Seybold and K. Simon, Tetris-Hashing or optimal table compression (1) 41- 58 Goldberg, M.K. ard D.L. Hollinger, Designing algorithms by sampling (1) 59- 75 Grossi, G., see A. Bertoni (1) 3-12 Habib, M., R. Medina, L. Nourine and G. Steiner, Efficient algorithms on distributive lattices (2-3) 169-187 Han, J., see B. Chen (2-3) 133-150 Hasunuma, T. and H. Nagamochi, Independent spanning trees with small depths in iterated line digraphs (2-3) 189-211 Hirvisalo, V., E. Nuutila and E. Soisalon-Soininen, Transitive closure algorithm MEMTC and its performance analysis (1) 77- 84 Hollinger , D.L., see M.K. Goldberg (1) 59- 75 Hvalica, D., Searching for a minimal solution subgraph in explicit AND/OR graphs (2-3) 213-225 Kagaris, D. and S. Tragoudas, Computational analysis of counter-based schemes for VLSI test pattern generation (2-3) 227-250 Lacko, V., see K. Cechlarova (2-3) 121-132 Liu, Y., see H. Ren (2-3) 273-288 Lodi, A., see M. Dell’Amico (1) 25- 40 Martello, S., see R. Battati (i) 1 Martello, S., see M. Dell’ Amico (1) 25- 40 Mauri, G., see P. Bonizzoni (1) 13- 24 Medina, R., see M. Habib (2-3) 169-187 Nagamochi, H., see T. Hasunuma (2-3) 189-211 Nourine, L., see M. Habib (2-3) 169-187 Nuutila, E., see V. Hirvisalo (1) 77- 84 Elsevier Science B.V. 328 Author Index / Discrete Applied Mathematics 110 (2001) 327-328 Pak, I. and V.H. Vu, On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes (2-3) 251-272 Ren, H. and Y. Liu, Enumerating near-4-regular maps on the sphere and the torus (2-3) 273-288 Rusu, I. and J. Spinrad, Domination graphs: examples and counterexamples (2-3) 289-300 Schmidt, G., see S. Albers (2-3) 85- 99 Seybold, B., see N. Galli (1) 41- 58 Shepherd, B. and L. Zhang, A cycle augmentation algorithm for minimum cost multicom- modity flows on a ring (2-3) 301-315 Simon, K., see N. Galli (1) 41- 58 Smid, M., see D.Z. Chen (2-3) 151-167 Soisalon-Soininen, E., see V. Hirvisalo (1) 77- 84 Spinrad, J., see I. Rusu (2-3) 289-300 Steiner, G., see M. Habib (2-3) 169-187 Tragoudas, S., see D. Kagaris (2-3) 227-250 Vedova, G.D, see P. Bonizzoni (1) 13- 24 Vu, V.H., see I. Pak (2-3) 251-272 Wen, J., see B. Chen (2-3) 133-150 Yamazaki, K., On approximation intractability of the path-distance-width problem (2-3) 317-325 Zhang , L., see B. Shepherd (2-3) 301-315