• L. Addario-Berry, K. Dalal, C. McDiarmid, B.A. Reed, A. Thomasson: Vertex-Colouring Edge-Weightings
• Angela Aguglia, Gábor Korchmáros: Blocking sets of external lines to a conic in PG(2,q),q odd
• Noga Alon, Asaf Shapira: On an Extremal Hypergraph Problem of Brown, Erdős and Sós
• Yonatan Bilu, Nathan Linial: Lifts, Discrepancy and Nearly Optimal Spectral Gaps
• Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer: Random subgraphs of finite graphs: III. The phase transition for the n-cube
• Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis Goddyn, Michael Lohman, Paul Seymour: Packing non-zero A-paths in group-labelled graphs
• Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Decomposing Berge graphs containing no proper wheel, long prism or their complements
• Alexander Gamburd, Igor Pak: Expansion of product replacement graphs
• C. D. Godsil, M. W. Newman: Independent sets in associoations shemes
• David J. Grynkiewicz: A weighted Erdős-Ginzburg-Ziv theorem
• András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-color Ramsey numbers for paths
• Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson: Reducing the seed length in the Nisan-Wigderson generator
• Mark Jerrum: Two remarks concerning balanced matroids
• J. H. Kim, V. H. Vu: Generating Random Regular Graphs
• Lap Chi Lau: An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Tomasz Luczak: On the structure of triangle-free graphs of large minimum degree
• Nathan Linial, Roy Meshulam: Homological connectivity of random 2-complexes
• Gyula Pap: Packing non-returning A-paths
• Wesley Pegden: Distance Sequences in Locally Infinite Vertex-Transitive Digraphs
• Gábor Simonyi, Gábor Tardos: Local chromatic number, Ky Fan's theorem, and circular colorings
• Joseph A. Thas, Koen Thas: Translation Generalized Quadrangles in Even Characteristic
• Ian M. Wanless: Addentum to Schrijver's work on minimum permanents