| 485 | -- | 520 | Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang. Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs |
| 521 | -- | 532 | Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. Every rayless graph has an unfriendly partition |
| 533 | -- | 552 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. Approximation algorithms via contraction decomposition |
| 553 | -- | 563 | Gábor Elek. On the limit of large girth graph sequences |
| 565 | -- | 580 | Shinya Fujita, Ken-ichi Kawarabayashi. Non-separating even cycles in highly connected graphs |
| 581 | -- | 615 | Manor Mendel, Assaf Naor. Maximum gradient embeddings and monotone clustering |