Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (ICALP, 1993)

A polyhedron with all s-t cuts as vertices, and adjacency of cuts. - Naveen Garg 001; Vijay V. Vazirani (IPCO, 1993)

Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. - Naveen Garg 001; Santosh S. Vempala; Aman Singla (SODA, 1993)

Multiway Cuts in Directed and Node Weighted Graphs. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (ICALP, 1994)

A Scaling Technique for Better Network Design. - Manica Aggarwal; Naveen Garg 001 (SODA, 1994)

A polyhedron with alls - t cuts as vertices, and adjacency of cuts. - Naveen Garg 001; Vijay V. Vazirani (Math. Program., 1995)

A 3-Approximation for the Minimum Tree Spanning k Vertices. - Naveen Garg 001 (FOCS, 1996)

Distributed List Coloring: How To Dynamically Allocate Frequencies To Mobile Base Stations. - Naveen Garg 001; Marina Papatriantafilou; Philippas Tsigas (SPDP, 1996)

Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (SIAM J. Comput., 1996)

An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. - Naveen Garg 001; Dorit S. Hochbaum (Algorithmica, 1997)

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (Algorithmica, 1997)

The p-Neighbor k-Center Problem. - Shiva Chaudhuri; Naveen Garg 001; R. Ravi 001 (Inf. Process. Lett., 1998)

A Randomized Algorithm for Flow Shop Scheduling. - Naveen Garg 001; Sachin Jain; Chaitanya Swamy (FSTTCS, 1999)

On the Single-Source Unsplittable Flow Problem. - Yefim Dinitz; Naveen Garg 001; Michel X. Goemans (Comb., 1999)

Finding Separator Cuts in Planar Graphs within Twice the Optimal. - Naveen Garg 001; Huzur Saran; Vijay V. Vazirani (SIAM J. Comput., 1999)

Minimizing stall time in single and parallel disk systems. - Susanne Albers; Naveen Garg 001; Stefano Leonardi 001 (J. ACM, 2000)

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. - Naveen Garg 001; Goran Konjevod; R. Ravi 001 (J. Algorithms, 2000)

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. - Naveen Garg 001; Rohit Khandekar; Goran Konjevod; R. Ravi 001; F. Sibel Salman; Amitabh Sinha II (IPCO, 2001)

Local search heuristic for k-median and facility location problems. - Vijay Arya; Naveen Garg 001; Rohit Khandekar; Adam Meyerson; Kamesh Munagala; Vinayaka Pandit (STOC, 2001)

Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. - Naveen Garg 001; Rohit Khandekar (FOCS, 2002)

On-Line End-to-End Congestion Control. - Naveen Garg 001; Neal E. Young (FOCS, 2002)

Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks. - Naveen Garg 001; Marina Papatriantafilou; Philippas Tsigas (Wirel. Networks, 2002)

Bandwidth Maximization in Multicasting. - Naveen Garg 001; Rohit Khandekar; Keshav Kunal; Vinayaka Pandit (ESA, 2003)

Covering Graphs Using Trees and Stars. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (RANDOM-APPROX, 2003)

A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. - Friedrich Eisenbrand; Stefan Funke; Naveen Garg 001; Jochen Könemann (SODA, 2003)

Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. - Naveen Garg 001; Rohit Khandekar (ESA, 2004)

Multiway cuts in node weighted graphs. - Naveen Garg 001; Vijay V. Vazirani; Mihalis Yannakakis (J. Algorithms, 2004)

Min-max tree covers of graphs. - Guy Even; Naveen Garg 001; Jochen Könemann; R. Ravi 001; Amitabh Sinha (Oper. Res. Lett., 2004)

Local Search Heuristics for k-Median and Facility Location Problems. - Vijay Arya; Naveen Garg 001; Rohit Khandekar; Adam Meyerson; Kamesh Munagala; Vinayaka Pandit (SIAM J. Comput., 2004)

Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. - Garima Batra; Naveen Garg 001; Garima Gupta (ESA, 2005)

Improved approximation for universal facility location. - Naveen Garg 001; Rohit Khandekar; Vinayaka Pandit (SODA, 2005)

Saving an epsilon: a 2-approximation for the k-MST problem in graphs. - Naveen Garg 001 (STOC, 2005)

Price of Anarchy, Locality Gap, and a Network Service Provider Game. - Nikhil R. Devanur; Naveen Garg 001; Rohit Khandekar; Vinayaka Pandit; Amin Saberi; Vijay V. Vazirani (WINE, 2005)

Better Algorithms for Minimizing Average Flow-Time on Related Machines. - Naveen Garg 001; Amit Kumar 001 (ICALP (1), 2006)

Minimizing average flow time on related machines. - Naveen Garg 001; Amit Kumar 001 (STOC, 2006)

Minimizing Average Flow-time: Upper and Lower Bounds. - Naveen Garg 001; Amit Kumar 001 (FOCS, 2007)

Order Scheduling Models: Hardness and Algorithms. - Naveen Garg 001; Amit Kumar 001; Vinayaka Pandit (FSTTCS, 2007)

Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. - Naveen Garg 001; Jochen Könemann (SIAM J. Comput., 2007)

Minimizing Total Flow-Time: The Unrelated Case. - Naveen Garg 001; Amit Kumar 001; V. N. Muralidhara (ISAAC, 2008)

Stochastic analyses for online combinatorial optimization problems. - Naveen Garg 001; Anupam Gupta 001; Stefano Leonardi 001; Piotr Sankowski (SODA, 2008)

Minimizing Average Flow-Time. - Naveen Garg 001 (Efficient Algorithms, 2009)

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. - Jivitej S. Chadha; Naveen Garg 001; Amit Kumar 001; V. N. Muralidhara (STOC, 2009)

A 3-Approximation for Facility Location with Uniform Capacities. - Ankit Aggarwal; Anand Louis; Manisha Bansal; Naveen Garg 001; Neelima Gupta; Shubham Gupta; Surabhi Jain (IPCO, 2010)

Assigning Papers to Referees. - Naveen Garg 001; Telikepalli Kavitha; Amit Kumar 001; Kurt Mehlhorn; Julián Mestre (Algorithmica, 2010)

Meeting Deadlines: How Much Speed Suffices? - S. Anand 002; Naveen Garg 001; Nicole Megow (ICALP (1), 2011)

A 4/3-approximation for TSP on cubic 3-edge-connected graphs - Nishita Aggarwal; Naveen Garg 001; Swati Gupta (CoRR, 2011)

A 5-Approximation for Capacitated Facility Location. - Manisha Bansal; Naveen Garg 001; Neelima Gupta (ESA, 2012)

Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. - Khaled M. Elbassioni; Naveen Garg 001; Divya Gupta 001; Amit Kumar 001; Vishal Narula; Arindam Pal 001 (FSTTCS, 2012)

Resource augmentation for weighted flow-time explained by dual fitting. - S. Anand 002; Naveen Garg 001; Amit Kumar 001 (SODA, 2012)

A 3-approximation algorithm for the facility location problem with uniform capacities. - Ankit Aggarwal; Anand Louis; Manisha Bansal; Naveen Garg 001; Neelima Gupta; Shubham Gupta; Surabhi Jain (Math. Program., 2013)

New Approximation Schemes for Unsplittable Flow on a Path. - Jatin Batra; Naveen Garg 001; Amit Kumar 001; Tobias Mömke; Andreas Wiese (SODA, 2015)

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. - S. Anand 002; Karl Bringmann; Tobias Friedrich 001; Naveen Garg 001; Amit Kumar 001 (Algorithmica, 2017)

Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. - Jatin Batra; Naveen Garg 001; Amit Kumar 001 (FOCS, 2018)

A 5-Approximation for Universal Facility Location. - Manisha Bansal; Naveen Garg 001; Neelima Gupta (FSTTCS, 2018)

On Fair Division for Indivisible Items. - Bhaskar Ray Chaudhury; Yun Kuen Cheung; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (FSTTCS, 2018)

On Fair Division of Indivisible Items. - Yun Kuen Cheung; Bhaskar Chaudhuri; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (CoRR, 2018)

Rejecting jobs to minimize load and maximum flow-time. - Anamitra Roy Choudhury; Syamantak Das; Naveen Garg 001; Amit Kumar 001 (J. Comput. Syst. Sci., 2018)

A 4/3-approximation for TSP on cubic 3-edge-connected graphs. - Nishita Agarwal; Naveen Garg 001; Swati Gupta (Oper. Res. Lett., 2018)

Non-Clairvoyant Precedence Constrained Scheduling. - Naveen Garg 001; Anupam Gupta 001; Amit Kumar 001; Sahil Singla 001 (ICALP, 2019)

Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow. - Naveen Garg 001; Nikhil Kumar 001 (ESA, 2020)

Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation. - Naveen Garg 001; Nikhil Kumar 001; András Sebö (IPCO, 2020)

Parallel Machine Scheduling to Minimize Energy Consumption. - Antonios Antoniadis 001; Naveen Garg 001; Gunjan Kumar; Nikhil Kumar 001 (SODA, 2020)

Hardness of Approximation for Orienteering with Multiple Time Windows. - Naveen Garg 001; Sanjeev Khanna; Amit Kumar 001 (SODA, 2021)

Locating Service and Charging Stations. - Rajni Dabas; Naveen Garg 001; Neelima Gupta; Dilpreet Kaur (WAOA, 2022)

Fair Division of Indivisible Goods for a Class of Concave Valuations. - Bhaskar Ray Chaudhury; Yun Kuen Cheung; Jugal Garg; Naveen Garg 001; Martin Hoefer 001; Kurt Mehlhorn (J. Artif. Intell. Res., 2022)

Integer plane multiflow maximisation: one-quarter-approximation and gaps. - Naveen Garg 001; Nikhil Kumar 001; András Sebö (Math. Program., 2022)

Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time. - Jatin Batra; Naveen Garg 001; Amit Kumar 001 (SIAM J. Comput., 2023)

Capacitated Facility Location with Outliers and Uniform Facility Costs. - Rajni Dabas; Naveen Garg 001; Neelima Gupta (IPCO, 2024)

The Flow Game: Leximin and Leximax Core Imputations. - Rohith Reddy Gangam; Naveen Garg 001; Parnian Shahkar; Vijay V. Vazirani (CoRR, 2024)