Publications  (in reverse chronological order):  

• The Santa Claus Problem, N. Bansal, M. Sviridenko.
  
• A Quasi-PTAS for unsplittable flow on line graphs,  N. Bansal, A. Chakrabarti, A. Epstein, B. Schieber.
• Minimizing Setup and Beam-On times in Radiation Therapy, N. Bansal, D. Coppersmith, B. Schieber.
• How well can Priceline sell airline tickets?, N. Bansal, N. Chen, N. Cherniavsky, A. Rudra, B. Schieber, M. Sviridenko.
  
• Improved Approximation Algorithms for broadcast Scheduling, N. Bansal, D. Coppersmith and M. Sviridenko,  in Symposium
  on Discrete Algorithms, SODA 06.
• A Tale of Two Dimensional Bin Packing,  N. Bansal, A. Lodi and M. Sviridenko, in Foundations of Computer  Science, FOCS 2005, 657-666.
• Speed scaling to manage temperature, N. Bansal and Kirk Pruhs, STACS 2005, 460-471.
  
• Approximation the Average Response Time in Broadcast Scheduling, N. Bansal, M. Charikar, S. Khanna and J. Naor, in
  Symposium on Discrete Algorithms, SODA 2005, 215-221. (This result has been improved in the SODA 06 paper above)
  
• Jobshop scheduling with unit processing times, N. Bansal, T. Kimbrel and M. Sviridenko, in Symposium on Discrete Algorithms,
  SODA 2005, 207-214. Journal version to appear in Math of Operations Research.
  
• Dynamic Speed Scaling to manage energy and temperature,  N. Bansal, T. Kimbrel and K. Pruhs, in Foundations of Computer  Science,
  FOCS 2004, 520-529.
  
• Further Improvements in Competitive Guarantees for QoS Buffering,  M. Mahdian, N. Bansal, L. Fleischer, T. Kimbrel, B. Schieber, M. Sviridenko,   in International Colloquium on Automata, Languages and Programming, ICALP 2004, 196-207.
  
• Efficient algorithms for finding submasses in weighted strings, N. Bansal, M. Cieliebak and Z. Liptak, in Combinatorial Pattern Matching, CPM 2004, 194-204. Journal version to appear in Discrete Applied Mathematics.
  
• One dimensional resource augmentation in 2D bin packing, N. Bansal and M. Sviridenko, submitted for publication.
  
• Minimizing makespan in no-wait job shops, N. Bansal, M. Mahdian and M. Sviridenko,  to appear in Mathematics of Operations Research
  
• Achievable sojourn times by non-size based policies in a GI/GI/1 queue, Nikhil Bansal, submitted for publication.
  
• Handling load with less stress, Nikhil Bansal and David Gamarnik, submitted for publication.  IBM Research Report RC23277.
  
• On the average sojourn time under M/M/1/SRPT, Nikhil Bansal, to appear in Operations Research Letters, Volume 33, 2, March 2005, 195-200.
  
• Approximation Agorithms for Deadline-TSP and Vehicle Routing  with Time-Windows, Nikhil Bansal, Avrim Blum, Shuchi Chawla and Adam Meyerson,  in Symposium on Theory of Computing, STOC 2004, 166-174.
• Server Scheduling in the Weighted l_p Norm, Nikhil Bansal and Kirk Pruhs,  in LATIN 2004, 434-443. 
• A Note on Comparing Response Times in the M/GI/1/FB and M/GI/1/PS Queues, Nikhil Bansal, Adam Wierman and Mor Harchol-Balter,  in  Operations Research Letters, 32(1), January 2004, 73-76.
• New Approximability and Inapproximability results for 2-dimensional bin packing,  in Symposium on Discrete Algorithms, SODA 2004, 189-196. Journal version to appear in Math of Operations Research
  
• On minimizing the total Flow Time on Multiple Machines, Nikhil Bansal, in Symposium on Discrete Algorithms,  SODA 2004,  565-567.
  Journal version in Operations Research Letters, 33(3), 267-273.
• Analysis of Processor Sharing with Bulk Arrivals, Nikhil Bansal in Operations Research Letters, 31(5), September 2003, 401-405.
  
• Online Oblivious Routing, Nikhil Bansal,  Avrim Blum, Shuchi Chawla and Adam Meyerson Symposium on Parallel Algorithms and Architectures, SPAA 2003, pages 44-49.  
• Scheduling For Flow-Time with Admission Control (or, How to manage your  to-do list) , Nikhil Bansal, Avrim Blum, Shuchi Chawla and Kedar Dhamdhere, European Symposium on Algorithms, ESA 2003, pages 43-54. 
•  Server Scheduling in the L_p Norm: A Rising Tide Lifts All Boats, Nikhil Bansal  and  Kirk Pruhs, in Symposium on Theory of Computing,   STOC 2003, pages 242-250.
• Capacity, Mobility and Delay in Wireless Ad hoc Networks, Nikhil Bansal and Zhen Liu,  in  INFOCOM 03. 
• Improving web Performance in Broadcast-Unicast Networks, Mukesh Agrawal, Amit Manjhi,  Nikhil Bansal and Srinivasan Seshan,  in  INFOCOM 03. 
• Minimizing Weighted Response Time , Nikhil Bansal  and Kedar Dhamdhere, in Symposium on Discrete Algorithms, SODA (2003),  pages 508-516.
• Size based Scheduling to improve web performance, Mor Harchol-Balter, Bianca  Schroeder, Nikhil Bansal  and Mukesh   Agarwal, in Transactions on Computer Systems, May 2003, 21(2), 207-233
• Non-Clairvoyant Scheduling for Mean Slowdown,  Nikhil Bansal, Kedar Dhamdhere, Jochen Konemann and Amitabh Sinha, Proc. of the 20th Intl. Symposium on Theoretical Aspectes of Computer Science  (STACS 2003), pages 260-270.  Journal version in Algorithmica 2004, 40, 305-318.
• Correlation Clustering, Nikhil Bansal,  Avrim Blum and Shuchi Chawla, 43rd Symposium on Foundations of Computer Science ( FOCS 2002),  pages 238-247.  Journal version appears in  Machine Learning Journal, special Issue: Theoretical Advances in Data Clustering (Guest Editors: Nina Mishra and Rajeev Motwani), 56 (1-3): 89-113.
• Bin-packing with Fragile Objects , Nikhil Bansal, Zhen Liu and Arvind Sankar, 2nd IFIP  Intl. Conf. on Theoretical Computer Science 02, pages 38-46.
• Approximate Analysis of M/G/1/PS and M/G/1/SRPT under Transient Overload ,  with Mor Harchol-Balter (preliminary work   appeared in (MAMA 2001), also as Performance Evaluation Review  Vol 29, 3, December 2001)
• Analysis of SRPT Scheduling: Investigating Unfairness , Nikhil Bansal and  Mor Harchol-Balter, In  ACM SIGMETRICS/PERFORMANCE 2001 , pages 279-290
• SRPT scheduling for Web Servers , Mor Harchol-Balter, Nikhil Bansal, Bianca Schroeder and Mukesh Agarwal, In Job Scheduling Strategies for Parallel Processing, JSSPP  2001, pages 11-20
• Upper Bounds for MaxSat: Further Improved,Nikhil Bansal and Venkatesh Raman, In  10th International Symposium, ISAAC  1999, pages 247-258. 
• An Identity for Strongly Connected Digraphs, Nikhil Bansal, American Mathematical Monthly, Nov. 1999