1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. of 46th IEEE FOCS, pp. 226–244 (2005)
2. Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint paths problem. In: Proc. of 37th ACM STOC, pp. 276–283. ACM Press, New York (2005)
3. Balister, P.: Packing digraphs with directed closed trials. Comb. Probab. Comput. 12, 1–15 (2003)
4. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239–256 (2003)
5. Chekuri, C., Khanna, S., Shepherd, B.: An $O(\sqrt{n})$ approximation and integrality gap for disjoint paths and UFP. Theory Comput. 2, 137–146 (2006)