1. Graph Connectivity After Path Removal

   • Guantao Chen*
   • Ronald J. Gould†
   • Xingxing Yu‡

   Original Paper Pages: 185 - 203

2. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

   • I. Dinur
   • G. Kindler
   • S. Safra

   Original Paper Pages: 205 - 243

3. Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube*

   • Friedrich Eisenbrand
   • Andreas S. Schulz

   Original Paper Pages: 245 - 261

4. Maximal Collections of Intersecting Arithmetic Progressions

   • Kevin Ford*

   Original Paper Pages: 263 - 281

5. Imperfect and Nonideal Clutters: A Common Approach

   • Grigor Gasparyan*
   • Myriam Preissmann
   • András Sebő

   Original Paper Pages: 283 - 302

6. Heavy Transversals and Indecomposable Hypergraphs

   • André E. Kézdy
   • Jenő Lehel*
   • Robert C. Powers

   Original Paper Pages: 303 - 310

7. Small Complete Arcs in Projective Planes

   • J. H. Kim
   • V. H. Vu*

   Original Paper Pages: 311 - 363