Elbassioni, Khaled Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2012/3865/ (Any fulltext)
Elbassioni, K., Garg, N., Gupta, D., Kumar, A., Narula, V., & Pal, A. (2012). Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. In D. D'Souza, T. Kavitha, & J. Radhakrishnan (Eds.), 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012 (pp. 267-275). Dagstuhl: Schloß Dagstuhl/Leibniz Zentrum für Informatik. doi:10.4230/LIPIcs.FSTTCS.2012.267.