1. Hard Squares for z = –1

   • R. J. Baxter

   OriginalPaper 05 June 2011 Pages: 185 - 195

2. Cyclic Sieving of Noncrossing Partitions for Complex Reflection Groups

   • David Bessis
   • Victor Reiner

   OriginalPaper 15 May 2011 Pages: 197 - 222

3. A Hive-Model Proof of the Second Reduction Formula of Littlewood-Richardson Coefficients

   • Soojin Cho
   • Eun-Kyoung Jung
   • Dongho Moon

   OriginalPaper 19 May 2011 Pages: 223 - 231

4. Cyclic (v; r, s; λ) Difference Families with Two Base Blocks and v ≤ 50

   • Dragomir Ž. Đoković

   OriginalPaper 15 May 2011 Pages: 233 - 254

5. Optimizing Phylogenetic Diversity with Ecological Constraints

   • Beáta Faller
   • Charles Semple
   • Dominic Welsh

   OriginalPaper 15 May 2011 Pages: 255 - 266

6. Cores of Geometric Graphs

   • Chris Godsil
   • Gordon F. Royle

   OriginalPaper 15 May 2011 Pages: 267 - 276

7. Enumerative Properties of NC ^(B) (p,q)

   • I. P. Goulden
   • Alexandru Nica
   • Ion Oancea

   OriginalPaper 15 May 2011 Pages: 277 - 303

8. Hook Lengths and 3-Cores

   • Guo-Niu Han
   • Ken Ono

   OriginalPaper 15 May 2011 Pages: 305 - 312

9. The q-Catalan Numbers: A Saddle Point Approach

   • Guy Louchard
   • Helmut Prodinger

   OriginalPaper 15 May 2011 Pages: 313 - 329

10. A Bijection Between Partially Directed Paths in the SymmetricWedge and Matchings

    • Svetlana Poznanović

    OriginalPaper 15 May 2011 Pages: 331 - 339

11. New Two-Line Arrays Representing Partitions

    • José Plínio O. Santos
    • Paulo Mondek
    • Andréia C. Ribeiro

    OriginalPaper 15 May 2011 Pages: 341 - 354

12. The Number of Spanning Trees in Self-Similar Graphs

    • Elmar Teufl
    • Stephan Wagner

    OriginalPaper 15 May 2011 Pages: 355 - 380