1. Crossing families

   • B. Aronov
   • P. Erdős
   • L. J. Schulman

   OriginalPaper Pages: 127 - 134

2. The expressive power of voting polynomials

   • J. Aspnes
   • R. Beigel
   • S. Rudich

   OriginalPaper Pages: 135 - 148

3. On the number of nowhere zero points in linear mappings

   • R. D. Baker
   • J. Bonin
   • E. Shustin

   OriginalPaper Pages: 149 - 157

4. On the divisibility of homogeneous hypergraphs

   • M. El-Zahar
   • N. Sauer

   OriginalPaper Pages: 159 - 165

5. Packet routing and job-shop scheduling inO(congestion+dilation) steps

   • F. T. Leighton
   • Bruce M. Maggs
   • Satish B. Rao

   OriginalPaper Pages: 167 - 186

6. Classifying vertex-transitive graphs whose order is a product of two primes

   • D. Marušič
   • R. Scapellato

   OriginalPaper Pages: 187 - 201

7. Communication in bounded depth circuits

   • P. Pudlák

   OriginalPaper Pages: 203 - 216

8. Call routing and the ratcatcher

   • P. D. Seymour
   • R. Thomas

   OriginalPaper Pages: 217 - 241

9. Cycles throughk vertices in bipartite tournaments

   • J. Bang-Jensen
   • Y. Manoussakis

   Note Pages: 243 - 246