| 427 | -- | 453 | Daniela Kühn, Deryk Osthus, Viresh Patel. A domination algorithm for {0, 1}-instances of the travelling salesman problem |
| 454 | -- | 479 | Radoslaw Adamczak, Djalil Chafaï, Pawel Wolff. Circular law for random matrices with exchangeable entries |
| 480 | -- | 502 | Richard Arratia, Skip Garibaldi, Joe Kilian. Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process |
| 503 | -- | 523 | Deepak Bal, Alan M. Frieze. Rainbow matchings and Hamilton cycles in random graphs |
| 524 | -- | 545 | Uriel Feige, Jonathan Hermon, Daniel Reichman. On giant components and treewidth in the layers model |
| 546 | -- | 564 | Asaf Ferber, Rajko Nenadov, Ueli Peter. Universality of random graphs and rainbow embedding |
| 565 | -- | 587 | Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun. Discovery Through Gossip |
| 588 | -- | 611 | Mikhail Lavrov, Po-Shen Loh. Increasing Hamiltonian paths in random edge orderings |
| 612 | -- | 638 | Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao. Improved bounds for the randomized decision tree Complexity of recursive majority |