| 3 | -- | 12 | F. Göbel, E. A. Neutel. Cyclic Graphs |
| 13 | -- | 21 | Harald Gropp. On some Infinite Series of (r, 1)-Designs |
| 23 | -- | 38 | Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien. On the Strong Chromatic Index of Cyclic Multigraphs |
| 39 | -- | 54 | Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. Independent Sets with Domination Constraints |
| 55 | -- | 69 | Anja Hamacher, Winfried Hochstättler, Christoph Moll. Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems |
| 71 | -- | 90 | Andreas Huck. Reducible Configurations for the Cycle Double Cover Conjecture |
| 91 | -- | 110 | Ekkehard Köhler. Connected Domination and Dominating Clique in Trapezoid Graphs |
| 111 | -- | 123 | Dieter Kratsch. Domination and Total Domination on Asteroidal Triple-free Graphs |
| 125 | -- | 148 | Ulrich Krüger. Structural Aspects of Ordered Polymatroids |
| 149 | -- | 156 | Jan B. M. Melissen, P. C. Schuur. Covering a Rectangle with Six and Seven Circles |
| 157 | -- | 167 | Markus Peter, Georg Wambach. N-extendible Posets, and How to Minimize Total Weighted Completion Time |
| 169 | -- | 181 | Erich Prisner. Recognizing k-path Graphs |
| 183 | -- | 208 | Anand Srivastav, Peter Stangier. On Complexity, Representation and Approximation of Integral Multicommodity Flows |
| 209 | -- | 227 | Zsolt Tuza, Vitaly I. Voloshin. Uncolorable Mixed Hypergraphs |
| 229 | -- | 244 | Joost P. Warners, Hans van Maaren. Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations |
| 245 | -- | 249 | Tianxing Yao, Yubao Guo, Kemin Zhang. Pancyclic out-arcs of a Vertex in Tournaments |
| 251 | -- | 259 | Irmina A. Ziolo. Subtrees of Bipartite Digraphs - The Minimum Degree Condition |
| 261 | -- | 277 | Eric Angel, Vassilis Zissimopoulos. On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient |
| 279 | -- | 293 | Claudio Arbib, Michele Flammini, Enrico Nardelli. How to Survive While Visiting a Graph |
| 295 | -- | 315 | Luitpold Babel. Recognition and Isomorphism of Tree-like P::4::-connected Graphs |
| 317 | -- | 321 | Douglas Bauer, Hajo Broersma, Henk Jan Veldman. Not Every 2-tough Graph Is Hamiltonian |
| 323 | -- | 329 | Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman. Chordality and 2-factors in Tough Graphs |
| 331 | -- | 338 | Anton Betten, Gunnar Brinkmann, Tomaz Pisanski. Counting Symmetric Configurations v::3:: |
| 339 | -- | 348 | Rodica Boliac, Dmitrii Lozovanu, D. Solomon. Optimal Paths in Network Games with P Players |
| 349 | -- | 366 | Andreas Brandstädt, Van Bang Le. Recognizing the P::4::-structure of Block Graphs |
| 367 | -- | 400 | Hajo Broersma, Elias Dahlhaus, Ton Kloks. A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs |
| 401 | -- | 411 | Hans Georg Carstens, Thomas Dinski, Eckhard Steffen. Reduction of Symmetric Configurations n::3:: |
| 413 | -- | 425 | Vladimir G. Deineko, Gerhard J. Woeginger. The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices |
| 427 | -- | 442 | Feodor F. Dragan. Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs |
| 443 | -- | 454 | Katalin Friedl, Shi-Chun Tsai. Two Results on the Bit Extraction Problem |