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