1. The complexity of computing the tutte polynomial on transversal matroids

   • Charles J. Colbourn
   • J. Scott Provan
   • Dirk Vertigan

   OriginalPaper Pages: 1 - 10

2. Riffle shuffles, cycles, and descents

   • Persi Diaconis
   • Michael Mc Grath
   • Jim Pitman

   OriginalPaper Pages: 11 - 29

3. Some graphs with small second eigenvalue

   • Joel Friedman

   OriginalPaper Pages: 31 - 42

4. On the second eigenvalue of hypergraphs

   • Joel Friedman
   • Avi Wigderson

   OriginalPaper Pages: 43 - 65

5. An analysis of a Monte Carlo algorithm for estimating the permanent

   • Alan Frieze
   • Mark Jerrum

   OriginalPaper Pages: 67 - 83

6. On Erdős-Rado numbers

   • Hanno Lefmann
   • Vojtěch Rödl

   OriginalPaper Pages: 85 - 104

7. On the number of lines in planar spaces

   • Klaus Metsch

   OriginalPaper Pages: 105 - 110

8. Natural bounded concentrators

   • Moshe Morgenstern

   OriginalPaper Pages: 111 - 122

9. Transversals of 2-intervals, a topological approach

   • Gábor Tardos

   OriginalPaper Pages: 123 - 134

10. A linear-time algorithm for edge-disjoint paths in planar graphs

    • Dorothea Wagner
    • Karsten Weihe

    OriginalPaper Pages: 135 - 150