Your search returned the following 15 documents:

15. Minimizing maximum (weighted) flow-time on related and unrelated machines
    S Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, and Amit Kumar
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), Riga, Latvia, 2013, 13-24
    
14. 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
    
13. Meeting deadlines: How much speed suffices?
    S. Anand, Naveen Garg, and Nicole Megow
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, Zurich, Switzerland, 2011, 232-243
    
12. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre
    Algorithmica 58 (1): 119-136, 2010
    
11. Assigning Papers to Referees
    Naveen Garg, T. Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre
    
    [PDF: Download: RefereeAssignment.pdf]
    
10. A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
    Friedrich Eisenbrand, Stefan Funke, Naveen Garg, and Jochen Könemann
    In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), Baltimore, USA, January, 12-14, 2003, 517-522
    
9. Approximation algorithm for the group Steiner tree problem
   Naveen Garg, Goran Konjevod, and R. Ravi
   Journal of Algorithms 37 (1): 66-84, 2000
   
8. Minimizing stall time in single and parallel disk systems
   Susanne Albers, Naveen Garg, and Stefano Leonardi
   Journal of the ACM 47 (6): 969-986, 2000
   
7. On the single-source unsplittable flow problem
   Yefim Dinitz, Naveen Garg, and Michel X. Goemans
   Combinatorica 19 (1): 17-41, 1999
   
6. Minimizing stall time in single and parallel disk systems
   Susanne Albers, Naveen Garg, and Stefano Leonardi
   In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), Dallas, USA, May 23-26, 1998, 454-462
   
5. The $p$-neighbor $k$-center problem
   Shiva Chaudhuri, Naveen Garg, and R. Ravi
   Information Processing Letters 65: 131-134, 1998
   
4. A polyhedron with all s-t cuts as vertices, and adjacency of cuts
   Naveen Garg and Vijay V. Vazirani
   Mathematical Programming (A) 70 (1): 17-25, 1995
   
3. A 3-approximation for the minimum tree spanning with k-vertices
   Naveen Garg
   In: Foundations of computer science (FOCS-96) : 37th annual symposium, Burlington, USA, 1996, 302-309
   
2. Approximate max-flow min-(multi)cut theorems and their applications
   Naveen Garg and Vijay V. Vazirani
   SIAM Journal on Computing 25 (2): 235-251, 1996
   
1. Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
   Naveen Garg, Marina Papatriantafilou, and Philippas Tsigas
   In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), New Orleans, October, 23rd-26th, 1996, 18-25