1. A Tree Version of Kőnig's Theorem

   • Ron Aharoni
   • Eli Berger
   • Ran Ziv

   Original Paper Pages: 335 - 343

2. Small Universal Graphs for Bounded-Degree Planar Graphs

   • Michael Capalbo

   Original Paper Pages: 345 - 359

3. Improved Bounds for Acyclic Job Shop Scheduling

   • Uriel Feige
   • Christian Scheideler

   Original Paper Pages: 361 - 399

4. Diophantine Approximations and Integer Points of Cones

   • Martin Henk
   • Robert Weismantel

   Original Paper Pages: 401 - 408

5. Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach

   • Andreas Huck
   • Eberhard Triesch

   Original Paper Pages: 409 - 416

6. Improved Pseudorandom Generators for Combinatorial Rectangles

   • Chi-Jen Lu

   Original Paper Pages: 417 - 434

7. Highly Arc-Transitive Digraphs With No Homomorphism Onto Z

   • Aleksander Malnič
   • Dragan Marušič
   • Boris Zgrablić

   Original Paper Pages: 435 - 443

8. An Anti-Ramsey Theorem

   • J. J. Montellano-Ballesteros
   • V. Neumann-Lara

   Original Paper Pages: 445 - 449

9. On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6

   • Frantisek Franek

   NOTE Pages: 451 - 454

10. The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four

    • Anna Galluccio
    • Luis A. Goddyn

    NOTE Pages: 455 - 459