Table Of Content

Available online at www.sciencedirect.com DISCRETE ecience @Poinecr- APPLIED MATHEMATICS Discrete Applied Mathematics 143 (2004) 379-380 www.elsevier.com/locate/dam Author Index Volume 143 (2004) Abel, R., see R. Julian (1-3) 43-53 Alvoni, E., On k nearest points of a finite set in a normed linear space (1-3) 23-30 Aneja, Y.P., see R. Chandrasekaran (1-3) 182-193 Armstrong, D.E. and S.H. Jacobson, Polynomial transformations and data-independent neighborhood functions (1-3) 272-284 Babel, L., B. Chen, H. Kellerer and V. Kotov, Algorithms for on-line bin-packing problems with cardinality constraints (1-3) 238-251 Barbe, A., F. von Haeseler and G. Skordev, Scaling properties of generalized Carlitz sequences of polynomials (1-3) 166-181 Caragiannis, I., A. Ferreira, C. Kaklamanis, S. Perennes, P. Persiano and H. Rivano, Approximate constrained bipartite edge coloring (1-3) 5461 Chandrasekaran, R., K.P.K. Nair, Y.P. Aneja and S.N. Kabadi, Multi-terminal multipath flows: synthesis (1-3) 182-193 Chang, G.J., The weighted independent domination problem is NP-complete for chordal graphs (1-3) 351-352 Chen, B., see L. Babel (1-3) 238-251 Costa, S., see R. Julian (1-3) 43-53 Czygrinow, A., M. Hanckowiak and E. Szymanska, Distributed algorithm for approximating the maximum matching (1-3) 62-1 Dankelmann, P., O.R. Oellermann and J.-L. Wu, Minimum average distance of strong orientations of graphs (1-3) 204-212 Dantas, S., C.M.H. de Figueiredo, S. Klein, S. Gravier and B.A. Reed, Stable skew partition problem (1-3) 7-2 Dantas, S., C.M.H. de Figueiredo and L. Faria, On decision and optimization (k, /)-graph sandwich problems (1-3) 155-165 de Figueiredo, C.M.H., see S. Dantas (1-3) Ti de Figueiredo, C.M.H., see S. Dantas (1-3) 155-165 Dumitrescu, A., The cost of cutting out convex n-gons (1-3) 353-358 Egge, E.S. and T. Mansour, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers (1-3) 72-83 Faria, L., see S. Dantas (1-3) 155-165 Ferreira, A., see I. Caragiannis (1-3) 5461 Finizio, N.J., see R. Julian (1-3) 43-53 Fitzpatrick, S., J. Janssen and R. Nowakowski, Distributive online channel assignment for hexagonal cellular networks with constraints (1-3) 84-91 Golumbic, M.C. and M. Lipshteyn, Chordal probe graphs (1-3) 221-237 Gracia, I., see C. Padro (1-3) 213-220 Gravier, S., see S. Dantas (1-3) 17-22 Hamers, H., see B. van Velzen (1-3) 298-306 Hamiez, J.-P. and J.-K. Hao, A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib) (1-3) 252-265 Hanckowiak, M., see A. Czygrinow (1-3) 62-71 Hao, J.-K., see J.-P. Hamiez (1-3) 252-265 Hayward, R.B. and R. Shamir, A note on tolerance graph recognition (1-3) 307-311 Huber, K.T., V. Moulton and C. Semple, Replacing cliques by stars in quasi-median graphs (1-3) 194-203 Ibaraki, T., see L. Zhao (1-3) 130-143 Jacobs, S.H., see D.E. Armstrong (1-3) 272-284 Janssen, J., see S. Fitzpatrick (1-3) 84-91 Jimbo, M., see M. Miller (1-3) 292-297 Julian, R., R. Abel, S. Costa and N.J. Finizio, Directed—ordered whist tournaments and (v,5,1) difference families: existence results and some new classes of Z-cyclic solutions (1-3) 43-53 doi:10.1016/S0166-218X(04)00234-3 380 Author Index | Discrete Applied Mathematics 143 (2004) 379-380 Kabadi, S.N., see R. Chandrasekaran (1-3) 182-193 Kaklamanis, C., see I. Caragiannis (1-3) 54-61 Karzanov, A.V., Hard cases of the multifacility location problem (1-3) 368-373 Kellerer, H., see L. Babel (1-3) 238-251 Kim, S.K., Order-preserving, upward drawing of binary trees using fewer bends (1-3) 318-323 Klazar, M., Extremal problems for ordered hypergraphs: small patterns and some enumeration (1-3) 144-154 Klein, S., see S. Dantas (1-3) 17-22 Kook, W., Recurrence relations for the spectrum polynomial of a matroid (1-3) 312-317 Kotov, V., see L. Babel (1-3) 238-251 Lee, J. and Y.-h. Shin, The achromatic number of the union of cycles (1-3) 330-335 Lichiardopol, N., Broadcast time and connectivity (1-3) 359-363 Lipshteyn, M., see M.C. Golumbic, (1-3) 221-237 Mahajan, M., P.R. Subramanya and V. Vinay, The combinatorial approach yields an NC algorithm for computing Pfaffians (1-3) 1-16 Mansour, T., see E.S. Egge (1-3) 72-83 Martin, S., see C. Padro (1-3) 213-220 Marx, D., Eulerian disjoint paths problem in grid graphs is NP-complete (1-3) 336-341 Moulton, V., see K.T. Huber (1-3) 194-203 Miiller, M. and M. Jimbo, Erasure-resilient codes from affine spaces (1-3) 292-297 Nagamochi, H., see L. Zhao (1-3) 130-143 Nair, K.P.K., see R. Chandrasekaran (1-3) 182-193 Norde, H., see B. van Velzen (1-3) 298-306 Nowakowski, R., see S. Fitzpatrick (1-3) 84-91 Oellermann, O.R., see P. Dankelmann (1-3) 204-212 Padro, C., I. Gracia and S. Martin, Improving the trade-off between storage and communication in broadcast encryption schemes (1-3) 213—220 Perennes, S., see I. Caragiannis (1-3) 5461 Persiano, P., see I. Caragiannis (1-3) 5461 Reed, B.A., see S. Dantas (1-3) 17-22 Richomme, G. and F. Wlazinski, Overlap-free morphisms and finite test-sets (1-3) 92-109 Rivano, H., see I. Caragiannis (1-3) 54-61 Salavatipour, M.R., A polynomial time algorithm for strong edge coloring of partial k-trees (1-3) 285-291 Sandman, N., A type-B Tamari poset (1-3) 110-122 Schréder, H., O. Sykora and I. Vrto, Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes (1-3) 123-129 Semple, C., see K.T. Huber (1-3) 194-203 Shamir, R., see R.B. Hayward (1-3) 307-311 Shin, Y.-h., see J. Lee (1-3) 330-335 Skordev, G., see A. Barbé (1-3) 166-181 Sonntag, M. and H.-M. Teichert, Competition hypergraphs (1-3) 324-329 Subramanya, P.R., see M. Mahajan (1-3) 1-16 SykO.o, sere Ha. Sc,hréd er (1-3) 123-129 Szymanska, E., see A. Czygrinow (1-3) 62-71 Teichert, H.-M., see M. Sonntag (1-3) 324-329 van Velzen, B., H. Hamers and H. Norde, Characterizing convexity of games using marginal vectors (1-3) 298-306 Venkateswaran, V., Minimizing maximum indegree (1-3) 374-378 Vietri, A., The complexity of arc-colorings for directed hypergraphs (1-3) 266-271 Vinay, V., see M. Mahajan (1-3) 1-16 von Haeseler, F., see A. Barbe (1-3) 166-181 Vrto, I., see H. Schroder (1-3) 123-129 Wang, W.-F., Vertex-pancyclicity of edge-face-total graphs (1-3) 364-367 Wlazinski, F., see G. Richomme (1-3) 92-109 Wu, B.Y., Approximation algorithms for the optimal p-source communication spanning tree (1-3) 31-42 Wu, B.Y., An improved algorithm for the k-source maximum eccentricity spanning trees (1-3) 342-350 Wu, J.-L., see P. Dankelmann (1-3) 204-212 Zhao, L., H. Nagamochi and T. Ibaraki, On generalized greedy splitting algorithms for multiway partition problems (1-3) 130-143