Graph Connectivity After Path Removal Guantao Chen*Ronald J. Gould†Xingxing Yu‡ Original Paper Pages: 185 - 203
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard I. DinurG. KindlerS. Safra Original Paper Pages: 205 - 243
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube* Friedrich EisenbrandAndreas S. Schulz Original Paper Pages: 245 - 261
Maximal Collections of Intersecting Arithmetic Progressions Kevin Ford* Original Paper Pages: 263 - 281
Imperfect and Nonideal Clutters: A Common Approach Grigor Gasparyan*Myriam PreissmannAndrás Sebő Original Paper Pages: 283 - 302
Heavy Transversals and Indecomposable Hypergraphs André E. KézdyJenő Lehel*Robert C. Powers Original Paper Pages: 303 - 310