| 1 | -- | 4 | Pierre Charbit, Stéphan Thomassé, Anders Yeo. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments |
| 5 | -- | 28 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka. Strong Refutation Heuristics for Random k-SAT |
| 29 | -- | 41 | Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan. Positive Influence and Negative Dependence |
| 43 | -- | 61 | Leslie Ann Goldberg, Mark Jerrum. The Complexity of Ferromagnetic Ising with Local Fields |
| 63 | -- | 83 | Kevin Hutson, Thomas M. Lewis. The Expected Length of a Minimal Spanning Tree of a Cylinder Graph |
| 85 | -- | 108 | Bill Jackson. Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs |
| 109 | -- | 126 | Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte. Rainbow Turán Problems |
| 127 | -- | 144 | Jan Remy, Alexander Souza, Angelika Steger. On an Online Spanning Tree Problem in Randomly Weighted Graphs |
| 145 | -- | 158 | C. R. Subramanian. List Set Colouring: Bounds and Algorithms |
| 159 | -- | 166 | Ãdám Timár. Cutsets in Infinite Graphs |
| 167 | -- | 169 | Alexandr V. Kostochka, Gexin Yu. Ore-type graph packing problems |
| 171 | -- | 172 | Norman Biggs. Topics in Algebraic Graph Theory, by Lowell W. Beineke and Robin J. Wilson (Academic Consultant: Peter J. Cameron), Encyclopedia of Mathematics and its Applications 102, CUP 2005, 257pp., GBP 50.00/ 95.00 |