| 85 | -- | 99 | Susanne Albers, Günter Schmidt. Scheduling with unexpected machine breakdowns |
| 101 | -- | 119 | Sergei L. Bezrukov. Embedding complete trees into the hypercube |
| 121 | -- | 132 | Katarína Cechlárová, Vladimír Lacko. Persistency in combinatorial optimization problems on matroids |
| 133 | -- | 150 | Bo Chen, Donglei Du, Jiye Han, Jianjun Wen. On-line scheduling of small open shops |
| 151 | -- | 167 | Danny Z. Chen, Gautam Das, Michiel H. M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths |
| 169 | -- | 187 | Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner. Efficient algorithms on distributive lattices |
| 189 | -- | 211 | Toru Hasunuma, Hiroshi Nagamochi. Independent spanning trees with small depths in iterated line digraphs |
| 213 | -- | 225 | Dusan Hvalica. Searching for a minimal solution subgraph in explicit AND/OR graphs |
| 227 | -- | 250 | Dimitrios Kagaris, Spyros Tragoudas. Computational analysis of counter-based schemes for VLSI test pattern generation |
| 251 | -- | 272 | Igor Pak, Van H. Vu. On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes |
| 273 | -- | 288 | Han Ren, Yanpei Liu. Enumerating near-4-regular maps on the sphere and the torus |
| 289 | -- | 300 | Irena Rusu, Jeremy Spinrad. Domination graphs: examples and counterexamples |
| 301 | -- | 315 | F. Bruce Shepherd, Lisa Zhang. A cycle augmentation algorithm for minimum cost multicommodity flows on a ring |
| 317 | -- | 325 | Koichi Yamazaki. On approximation intractability of the path-distance-width problem |