1. Non-periodic Tilings of ℝ ⁿ by Crosses

   • Peter Horak
   • Bader AlBdaiwi

   OriginalPaper 03 September 2011 Pages: 1 - 16

2. Matroid Enumeration for Incidence Geometry

   • Yoshitake Matsumoto
   • Sonoko Moriyama
   • David Bremner

   OriginalPaper 30 November 2011 Pages: 17 - 43

3. Efficient Subspace Approximation Algorithms

   • Nariankadu D. Shyamalkumar
   • Kasturi Varadarajan

   OriginalPaper 11 November 2011 Pages: 44 - 63

4. Oriented Interval Greedoids

   • Franco Saliola
   • Hugh Thomas

   OriginalPaper 08 November 2011 Pages: 64 - 105

5. Weakly Regular Subdivisions

   • Lionel Pournin

   OriginalPaper 17 August 2011 Pages: 106 - 116

6. Topology of Random 2-Complexes

   • D. Cohen
   • A. Costa
   • T. Kappeler

   OriginalPaper 21 October 2011 Pages: 117 - 149

7. Hinged Dissections Exist

   • Timothy G. Abbott
   • Zachary Abel
   • Scott Duke Kominers

   OriginalPaper 01 October 2011 Pages: 150 - 186

8. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs

   • V. Chepoi
   • F. F. Dragan
   • Y. Vaxès

   OriginalPaper 23 November 2011 Pages: 187 - 214

9. A Face of a Projective Triangulation Removed for Its Geometric Realizability

   • Atsuhiro Nakamoto
   • Shoichi Tsuchiya

   OriginalPaper 18 August 2011 Pages: 215 - 234