1. Algorithms for Graphs Embeddable with Few Crossings per Edge

   • Alexander Grigoriev
   • Hans L. Bodlaender

   OriginalPaper 02 August 2007 Pages: 1 - 11

2. The Complexity of the Single Individual SNP Haplotyping Problem

   • Rudi Cilibrasi
   • Leo van Iersel
   • John Tromp

   OriginalPaper 03 August 2007 Pages: 13 - 36

3. Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems

   • Nir Halman

   OriginalPaper Pages: 37 - 50

4. SONET ADMs Minimization with Divisible Paths

   • Leah Epstein
   • Asaf Levin

   OriginalPaper Pages: 51 - 68

5. Sample Complexity for Computational Classification Problems

   • Daniil Ryabko

   OriginalPaper Pages: 69 - 77

6. Approximation Algorithms for Connected Dominating Sets

   • S. Guha
   • S. Khuller

   Erratum Pages: 79 - 79