1. How Neighborly Can a Centrally Symmetric Polytope Be?

   • Nathan Linial
   • Isabella Novik

   OriginalPaper 18 April 2006 Pages: 273 - 281

2. A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs

   • Seok-Hee Hong
   • Brendan McKay
   • Peter Eades

   OriginalPaper 13 July 2006 Pages: 283 - 311

3. Homotopy Type of Complexes of Graph Homomorphisms between Cycles

   • Sonja Lj. Cukic
   • Dmitry N. Kozlov

   OriginalPaper 28 June 2006 Pages: 313 - 329

4. A Geometric Study of the Split Decomposition

   • Hiroshi Hirai

   OriginalPaper 05 June 2006 Pages: 331 - 361

5. Isodiametric Problems for Polygons

   • Michael J. Mossinghoff

   OriginalPaper 18 April 2006 Pages: 363 - 379

6. There Is No Face-to-Face Partition of R⁵ into Acute Simplices

   • Michal Krizek

   OriginalPaper 05 June 2006 Pages: 381 - 390