| 441 | -- | 0 | Paul Balister, Béla Bollobás, Imre Leader, Robert Morris 0001. Introduction |
| 442 | -- | 448 | Noga Alon. Uniformly Discrete Forests with Poor Visibility |
| 449 | -- | 474 | József Balogh, Andrew McDowell, Theodore Molla, Richard Mycroft. Triangle-Tilings in Graphs Without Large Independent Sets |
| 475 | -- | 495 | Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh. Packing Hamilton Cycles Online |
| 496 | -- | 530 | Amin Coja-Oghlan, Nick Wormald. The Number of Satisfying Assignments of Random Regular k-SAT Formulas |
| 531 | -- | 538 | Dwight Duffus, Bill Kay, Vojtech Rödl. The Minimum Number of Edges in Uniform Hypergraphs with Property O |
| 539 | -- | 579 | Jacob Fox, Fan Wei. Fast Property Testing and Metrics for Permutations |
| 580 | -- | 622 | Vytautas Gruslys, Shoham Letzter. Minimizing the Number of Triangular Edges |
| 623 | -- | 642 | Nina Kamcev, Tomasz Luczak, Benny Sudakov. Anagram-Free Colourings of Graphs |
| 643 | -- | 666 | Johannes Lengler, Angelika Steger. Drift Analysis and Evolutionary Algorithms Revisited |
| 667 | -- | 671 | Bhargav Narayanan. Connections in Randomly Oriented Graphs |
| 672 | -- | 715 | Dudley Stark, Nick Wormald. The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph |