1. Scheduling jobs with fixed start and end times;Arkin;Discrete Applied Mathematics,1987
2. A quasi-ptas for unsplittable flow on line graphs;Bansal,2006
3. A logarithmic approximation for unsplittable flow on line graphs;Bansal,2009
4. A unified approach to approximating resource allocation and scheduling;Bar-Noy;Journal of the ACM,2001
5. The temporal knapsack problem and its solution;Bartlett,2005