World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

Naveen Garg publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Naveen Garg sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 250 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 560 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 103 publications — 9th percentile

9% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Naveen Garg D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Naveen Garg sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 31 D-Index — 6th percentile

6% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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