1. Awerbuch B, Azar Y, Epstein A (2005) The price of routing unsplittable flows. In: Proceedings of the ACM symposium on theory of computing (STOC) 2005. ACM, New York, pp 57–66
2. Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10:303–318
3. Fotakis D, Kontogiannis S, Spirakis P (2006) Symmetry in network congestion games: pure equilibria and anarchy cost. In: Proceedings of the 3rd workshop of approximate and on-line algorithms (WAOA 2005). Lecture notes in computer science (LNCS), vol 3879. Springer, Berlin/Heidelberg, pp 161–175
4. Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. J Theor Comput Sci 348:226–239
5. Libman L, Orda A (2001) Atomic resource sharing in noncooperative networks. Telecommun Syst 17(4):385–409