| 3 | -- | 14 | David Avis, Antoine Deza. On the binary solitaire cone |
| 15 | -- | 36 | Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone. Combinatorial problems related to origin-destination matrices |
| 37 | -- | 47 | András Frank, Tibor Jordán, Zoltán Szigeti. Combinatorial problems related to origin-destination matrices |
| 49 | -- | 62 | Harold N. Gabow, Tibor Jordán. Bipartition constrained edge-splitting in directed graphs |
| 63 | -- | 71 | Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama. Lengths of tours and permutations on a vertex set of a convex polygon |
| 73 | -- | 76 | Atsushi Kaneko. Spanning trees with constraints on the leaf degree |
| 77 | -- | 88 | Gyula Károlyi, Emo Welzl. Crossing-free segments and triangles in point configurations |
| 89 | -- | 97 | Kenji Kashiwabara. Subdivisions of integral base polytopes |
| 99 | -- | 115 | Gyula Y. Katona. A large set of non-Hamiltonian graphs |
| 117 | -- | 133 | Ton Kloks, Richard B. Tan. Bandwidth and topological bandwidth of graphs with few P4 s |
| 135 | -- | 149 | Tetsushi Koide, S. Shinmori, H. Ishii. Topological optimization with a network reliability constraint |
| 151 | -- | 176 | Kazuo Murota, Akiyoshi Shioura. Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella |
| 177 | -- | 186 | Takao Nishizeki, Jens Vygen, Xiao Zhou. The edge-disjoint paths problem is NP-complete for series-parallel graphs |
| 187 | -- | 198 | Norbert Radics. Rigidity of multi-story buildings |
| 199 | -- | 208 | András Recski. Some polynomially solvable subcases of the detailed routing problem in VLSI design |
| 209 | -- | 219 | Tadashi Sakuma. On kernel-less clique-acyclic orientations of minimally imperfect graphs |