| 1 | -- | 0 | Endre Boros. Preface |
| 3 | -- | 11 | Marion Alfter, Winfried Hochstättler. On Pseudomodular Matroids and Adjoints |
| 13 | -- | 23 | Fred S. Annexstein, John V. Franco. Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram |
| 25 | -- | 37 | Ansuman Bagchi, Brigitte Servatius, Weigeng Shi. 2-satisfiability and Diagnosing Faulty Processors in Massively Parallel Computing Systems |
| 39 | -- | 76 | Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman. The Reversing Number of a Digraph |
| 77 | -- | 91 | Kenneth A. Berman, John V. Franco, John S. Schlipf. Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time |
| 93 | -- | 98 | Kenneth P. Bogart, Joseph E. Bonin, Jutta Mitas. Interval orders Based on Weak orders |
| 99 | -- | 117 | Kenneth P. Bogart, Peter C. Fishburn, Garth Isaak, Larry J. Langley. Proper and Unit Tolerance Graphs |
| 119 | -- | 129 | Charles J. Colbourn, J. Scott Provan, Dirk Vertigan. A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs |
| 131 | -- | 140 | Ding-Zhu Du. on Component-size Bounded Steiner Trees |
| 141 | -- | 147 | Paul Erdös, Peter C. Fishburn. Multiplicities of Interpoint Distances in Finite Planar Sets |
| 149 | -- | 158 | Paul Erdös, Peter C. Fishburn. Intervertex Distances in Convex Polygons |
| 159 | -- | 179 | Giorgio Gallo, Daniele Pretolani. A New Algorithm for the Propositional Satisfiability Problem |
| 181 | -- | 193 | Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão. Boole s Conditions of Possible Experience and Reasoning under Uncertainty |
| 195 | -- | 210 | Alain Hertz. Polynomially Solvable Cases for the Maximum Stable Set Problem |
| 211 | -- | 217 | Kathy Williamson Hoke. Extending Shelling orders and a Hierarchy of Functions of Unimodal Simple Polytopes |
| 219 | -- | 222 | Frank K. Hwang. The Time Complexity of Deterministic Broadcast Radio Networks |
| 223 | -- | 248 | Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger. Permuting Matrices to Avoid Forbidden Submatrices |
| 249 | -- | 255 | Alexander Kogan. on the Essential Test Sets of Discrete Matrices |
| 257 | -- | 266 | Larry J. Langley. A Recognition Algorithm for orders of Interval Dimension Two |
| 267 | -- | 273 | Larry J. Langley. Irreflexive and Reflexive Dimension |
| 275 | -- | 284 | Felix Lazebnik, Vasiliy A. Ustimenko. Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size |
| 285 | -- | 291 | Xiaoyun Lu. A Note on Biased and Non-biased Games |
| 293 | -- | 309 | Zeev Nutov, Michal Penn. on the Integral Dicycle Packings and Covers and the Linear ordering Polytope |
| 311 | -- | 318 | Uri N. Peled, Feng Sun. Enumeration of Difference Graphs |
| 319 | -- | 329 | Stephen G. Penrice. on-line Algorithms for ordered Sets and Comparability Graphs |
| 331 | -- | 342 | Cedric Picouleau. New Complexity Results on Scheduling with Small Communication Delays |
| 343 | -- | 347 | Sanjay Rajpal. on Paving Matroids and a Generalization of MDS Codes |
| 349 | -- | 358 | Maciej M. Syslo. on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets |
| 359 | -- | 387 | Ann N. Trenk. Generalized Perfect Graphs: Characterizations and Inversion |