Your search returned the following 3 documents:

3. Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
   Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, and Arindam Pal
   In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, Hyderabad, India, 2012, 267-275
   
2. Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzík Bound
   Matthias Mnich, Geevarghese Philip, Saket Saurabh, and Ondrej Suchy
   In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012, 412-423
   [PDF: Download: published.pdf]
   
1. Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
   Daniel Lokshtanov, Saket Saurabh, and Magnus Wahlström
   In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Hyderabad, India, 2012, 424-434