Discrete Applied Mathematics, Volume 138

Volume 138, Number 1-2, 29 March 2004

• Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn:
  Preface: ODSA. 1
  Electronic Edition (link) BibTeX
• M. Cemil Azizoglu, Ömer Eeciolu:
  The bisection width and the isoperimetric number of arrays. 3-12
  Electronic Edition (link) BibTeX
• Andreas Brandstädt:
  (P₅, diamond)-free graphs revisited: structure and linear time optimization. 13-27
  Electronic Edition (link) BibTeX
• Dietmar Cieslik:
  The Steiner ratio of high-dimensional Banach-Minkowski spaces. 29-34
  Electronic Edition (link) BibTeX
• Myra B. Cohen, Charles J. Colbourn:
  Ladder orderings of pairs and RAID performance. 35-46
  Electronic Edition (link) BibTeX
• Ramadan El-Shanawany, Hans-Dietrich O. F. Gronau, Martin Grüttmüller:
  Orthogonal double covers of K_{n, n} by small graphs. 47-63
  Electronic Edition (link) BibTeX
• Hans-Dietrich O. F. Gronau, Donald L. Kreher, Alan C. H. Ling:
  Super-simple (v, 5, 2)-designs. 65-77
  Electronic Edition (link) BibTeX
• Harald Gropp:
  Configurations between geometry and combinatorics. 79-88
  Electronic Edition (link) BibTeX
• Martin Grüttmüller:
  Completing partial latin squares with prescribed diagonals. 89-97
  Electronic Edition (link) BibTeX
• Harri Haanpää, Antti Huima, Patric R. J. Östergård:
  Sets in Z _nwith distinct sums of pairs. 99-106
  Electronic Edition (link) BibTeX
• Sven Hartmann, Ulrike Schumacher:
  Orthogonal double covers of general graphs. 107-116
  Electronic Edition (link) BibTeX
• Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev:
  On simplicial and co-simplicial vertices in graphs. 117-132
  Electronic Edition (link) BibTeX
• Petteri Kaski, Patric R. J. Östergård:
  Enumeration of balanced ternary designs. 133-141
  Electronic Edition (link) BibTeX
• Kari J. Nurmela:
  Upper bounds for covering arrays by tabu search. 143-152
  Electronic Edition (link) BibTeX
• Philippe Pitteloud:
  On the log-concavity of sequences arising from integer bases. 153-175
  Electronic Edition (link) BibTeX
• Alexander Pott:
  Nonlinear functions in abelian groups and relative difference sets. 177-193
  Electronic Edition (link) BibTeX
• Michael Sampels:
  Vertex-symmetric generalized Moore graphs. 195-202
  Electronic Edition (link) BibTeX
• Jeremy Spinrad:
  Recognizing quasi-triangulated graphs. 203-213
  Electronic Edition (link) BibTeX
• Csaba D. Tóth:
  Illuminating labyrinths. 215-228
  Electronic Edition (link) BibTeX
• Ingo Wegener:
  BDDs--design, analysis, complexity, and applications. 229-251
  Electronic Edition (link) BibTeX

Volume 138, Number 3, 15 April 2004

• Uri Keich, Ming Li, Bin Ma, John Tromp:
  On spaced seeds for similarity search. 253-263
  Electronic Edition (link) BibTeX
• Gennian Ge, Clement W. H. Lam:
  Whist tournaments with the three person property. 265-276
  Electronic Edition (link) BibTeX
• Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
  Fixed points and maximal independent sets in AND-OR networks. 277-288
  Electronic Edition (link) BibTeX
• Igor Averbakh, Vasilij Lebedev:
  Interval data minmax regret network optimization problems. 289-301
  Electronic Edition (link) BibTeX
• Eduardo A. Canale, José Gómez:
  Superfluous edges and exponential expansions of De Bruijn and Kautz graphs. 303-331
  Electronic Edition (link) BibTeX
• Katarína Cechlárová, Jana Hajduková:
  Stable partitions with W -preferences. 333-347
  Electronic Edition (link) BibTeX
• Yoshio Okamoto:
  Traveling salesman games with the Monge property. 349-369
  Electronic Edition (link) BibTeX
• Derek G. Corneil:
  A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. 371-379
  Electronic Edition (link) BibTeX