| 643 | -- | 660 | Yonatan Bilu, Nathan Linial. Are Stable Instances Easy? |
| 661 | -- | 682 | Julia Böttcher, Anusch Taraz, Andreas Würfl. Perfect Graphs of Fixed Density: Counting and Homogeneous Sets |
| 683 | -- | 694 | Nicolas Curien. Strong Convergence of Partial Match Queries in Random Quadtrees |
| 695 | -- | 714 | Qi Ge, Daniel Stefankovic. A Graph Polynomial for Independent Sets of Bipartite Graphs |
| 715 | -- | 733 | Alexander Gnedin, Alexander Iksanov, Alexander Marynych. A Generalization of the Erdős-Turán Law for the Order of Random Permutation |
| 734 | -- | 742 | Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov. Non-Three-Colourable Common Graphs Exist |
| 743 | -- | 772 | Tomer Kotek. Complexity of Ising Polynomials |
| 773 | -- | 801 | Choongbum Lee, Benny Sudakov, Dan Vilenchik. Getting a Directed Hamilton Cycle Two Times Faster |