World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
9476
World Ranking
13351
National Ranking
154

Overview

Naveen Garg is affiliated with the Indian Institute of Technology Delhi in India. Their research spans fields including Computer Science and Engineering, with a particular focus on computational theory and mathematics, industrial and manufacturing engineering, and computer networks and communications.

The scientist's recent publication record features work across several topics such as advanced graph theory research, vehicle routing optimization methods, complexity and algorithms in graphs, facility location and emergency management, data management and algorithms, optimization and search problems, as well as constraint satisfaction and optimization.

  • Parallel machine scheduling to minimize energy consumption, 2020, Symposium on Discrete Algorithms
  • Fair Division of Indivisible Goods for a Class of Concave Valuations, 2022, Journal of Artificial Intelligence Research
  • Integer plane multiflow maximisation: one-quarter-approximation and gaps, 2021, Mathematical Programming
  • Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse, 2024, arXiv (Cornell University)

Naveen Garg has collaborated frequently with several coauthors, including Nikhil Kumar, Rajni Dabas, András Sebö, András Sebő, and Antonios Antoniadis. Their publication venues also reflect a diversity of academic outlets, including Mathematical Programming, arXiv (Cornell University), Symposium on Discrete Algorithms, Journal of Artificial Intelligence Research, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

In addition to journal and conference papers, the scientist has contributed to academic books, with a notable publication titled Integer Programming and Combinatorial Optimization published by Springer Science+Business Media in 2020.

Best Publications

  • Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

    Naveen Garg;Jochen Könemann

  • Local Search Heuristics for k -Median and Facility Location Problems

    Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson

  • Local search heuristic for k-median and facility location problems

    Vijay Arya;Naveen Garg;Rohit Khandekar;Adam Meyerson

  • Faster and simpler algorithms for multicommodity flow and other fractional packing problems

    N. Garg;J. Konemann

  • Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Primal-dual approximation algorithms for integral flow and multicut in trees

    N. Garg;V. V. Vazirani;M. Yannakakis

  • A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

    Naveen Garg;Goran Konjevod;R. Ravi

  • On the single-source unsplittable flow problem

    Yefim Dinitz;Naveen Garg;Michel X. Goemans

  • Saving an epsilon: a 2-approximation for the k-MST problem in graphs

    Naveen Garg

  • A 3-approximation for the minimum tree spanning k vertices

    N. Garg

  • Multiway Cuts in Directed and Node Weighted Graphs

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Multiway cuts in node weighted graphs

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Min-max tree covers of graphs

    G. Even;N. Garg;J. KöNemann;R. Ravi

  • Assigning Papers to Referees

    Naveen Garg;Telikepalli Kavitha;Amit Kumar;Kurt Mehlhorn

  • Resource augmentation for weighted flow-time explained by dual fitting

    S. Anand;Naveen Garg;Amit Kumar

  • Approximate max-flow min-(multi)cut theorems and their applications

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • A polylogarithmic approximation algorithm for the group Steiner tree problem

    Naveen Garg;Goran Konjevod;R. Ravi

  • A 5-approximation for capacitated facility location

    Manisha Bansal;Naveen Garg;Neelima Gupta

  • Stochastic analyses for online combinatorial optimization problems

    Naveen Garg;Anupam Gupta;Stefano Leonardi;Piotr Sankowski

  • An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

    Naveen Garg;Dorit S. Hochbaum

  • A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

    Jivitej S. Chadha;Naveen Garg;Amit Kumar;V. N. Muralidhara

  • Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Minimizing stall time in single and parallel disk systems

    Susanne Albers;Naveen Garg;Stefano Leonardi

  • Assigning Papers to Referees

    Kurt Mehlhorn

Frequent Co-Authors

Amit Kumar
Amit Kumar All India Institute of Medical Sciences
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
R. Ravi
R. Ravi Carnegie Mellon University
Mihalis Yannakakis
Mihalis Yannakakis Columbia University
Stefano Leonardi
Stefano Leonardi Sapienza University of Rome
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Guy Even
Guy Even Tel Aviv University
Philippas Tsigas
Philippas Tsigas Chalmers University of Technology
Anupam Gupta
Anupam Gupta Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring alternatives to on-campus study can open up new possibilities for learners. Many universities now offer flexible options like an online computer science degree. These programs allow you to study at your own pace while building strong technical skills from anywhere in the world.

Interested in fields closely related to computer science? You may want to consider interdisciplinary options such as the cheapest online environmental science degree or the cheapest online master's mechanical engineering. These degrees provide a solid foundation for tech-driven roles in environmental sustainability and innovative engineering.

For those who prefer the fundamentals behind technology, exploring the cheapest online physics degree can be an excellent pathway. Each online program offers unique advantages—such as affordability, flexibility, and specialized knowledge—to help you launch or advance your career in science, engineering, or technology.

Best Scientists Citing Naveen Garg

Trending Scientists

Recently Published Articles