| 335 | -- | 343 | Ron Aharoni, Eli Berger, Ran Ziv. A Tree Version of Konig s Theorem |
| 345 | -- | 359 | Michael R. Capalbo. Small Universal Graphs for Bounded-Degree Planar Graphs |
| 361 | -- | 399 | Uriel Feige, Christian Scheideler. Improved Bounds for Acyclic Job Shop Scheduling |
| 401 | -- | 408 | Martin Henk, Robert Weismantel. Diophantine Approximations and Integer Points of Cones |
| 409 | -- | 416 | Andreas Huck, Eberhard Triesch. Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach |
| 417 | -- | 434 | Chi-Jen Lu. Improved Pseudorandom Generators for Combinatorial Rectangles |
| 435 | -- | 443 | Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic. Highly Arc-Transitive Digraphs With No Homomorphism Onto Z |
| 445 | -- | 449 | Juan José Montellano-Ballesteros, Victor Neumann-Lara. An Anti-Ramsey Theorem |
| 451 | -- | 454 | Frantisek Franek. On Erdös s Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6 |
| 455 | -- | 459 | Anna Galluccio, Luis A. Goddyn. The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four |