1. Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

   • Matthew Andrews
   • Julia Chuzhoy
   • Lisa Zhang

   OriginalPaper 13 March 2011 Pages: 485 - 520

2. Every rayless graph has an unfriendly partition

   • Henning Bruhn
   • Reinhard Diestel
   • Philipp Sprüssel

   OriginalPaper 13 March 2011 Pages: 521 - 532

3. Approximation algorithms via contraction decomposition

   • Erik D. Demaine
   • MohammadTaghi Hajiaghayi
   • Bojan Mohar

   OriginalPaper 13 March 2011 Pages: 533 - 552

4. On the limit of large girth graph sequences

   • Gábor Elek

   OriginalPaper 13 March 2011 Pages: 553 - 563

5. Non-separating even cycles in highly connected graphs

   • Shinya Fujita
   • Ken-ichi Kawarabayashi

   OriginalPaper 13 March 2011 Pages: 565 - 580

6. Maximum gradient embeddings and monotone clustering

   • Manor Mendel
   • Assaf Naor

   OriginalPaper 13 March 2011 Pages: 581 - 615