1. On the complexity of approximating tsp with neighborhoods and related problems

   • Shmuel Safra
   • Oded Schwartz

   Original Paper Pages: 281 - 307

2. The complexity of chromatic strength and chromatic edge strength

   • Dániel Marx

   Original Paper Pages: 308 - 340

3. Languages to diagonalize against advice classes

   • Chris Pollett

   Original Paper Pages: 341 - 361

4. On the computational power of Boolean decision lists

   • Matthias Krause

   Original Paper Pages: 362 - 375