Your search returned the following 4 documents:

4. Competitive Algorithms for Due Date Schedulin
   Nikhil Bansal, Ho-Leung Chan, and KIrk Pruhs
   Algorithmica 59 (4): 569-582, 2011
   
3. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
   Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, and Atri Rudra
   In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, Liverpool, UK, 2010, 218-229
   
2. Speed Scaling with an Arbitrary Power Function
   Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs
   In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 693-701
   
1. Weighted flow time does not admit O(1)-competitive algorithms
   Nikhil Bansal and Ho-Leung Chan
   In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 1238-1244