World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
66
Citations
15571
World Ranking
2351
National Ranking
1171

Chandra Chekuri 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 Chandra Chekuri 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: 249 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: 559 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: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 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: 202 publications — 47th percentile

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

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

Chandra Chekuri 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 Chandra Chekuri sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 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: 66 D-Index — 84th percentile

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

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

Overview

Chandra Chekuri is affiliated with the University of Illinois at Urbana-Champaign in the United States. Their research focuses primarily in the field of computer science, with a significant emphasis on computational theory and mathematics. They have contributed extensively in subfields including computer networks and communications, artificial intelligence, computer graphics and computer-aided design, and industrial and manufacturing engineering.

The main topics covered by their research include:

  • Complexity and Algorithms in Graphs
  • Advanced Graph Theory Research
  • Optimization and Search Problems
  • Computational Geometry and Mesh Generation
  • Graph theory and applications
  • Cryptography and Data Security
  • Auction Theory and Applications

Their publication record spans a variety of venues, highlighting engagement with both theoretical and applied aspects of computer science. Frequent publication venues for Chekuri's work include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Theory of Computing
  • Mathematical Programming
  • SIAM Journal on Discrete Mathematics

Notable recent papers authored by Chandra Chekuri include:

  • "LP Relaxation and Tree Packing for Minimum k-Cut," published in 2020 in SIAM Journal on Discrete Mathematics
  • "Algorithms for covering multiple submodular constraints and applications," published in 2022 in Journal of Combinatorial Optimization
  • Unknown-title paper published in 2020 in Theory of Computing
  • "Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity," published in 2021 by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Chekuri has collaborated frequently with several researchers, with recurrent co-authors including Kent Quanrud, Rhea Jain, Karthekeyan Chandrasekaran, Manuel R. Torres, and Shubhang Kulkarni. These collaborations reflect interdisciplinary work and joint efforts within graph theory, optimization, and algorithms.

Best Publications

  • Incremental Clustering and Dynamic Information Retrieval

    Moses Charikar;Chandra Chekuri;Tomas Feder;Rajeev Motwani

  • Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

    Gruia Calinescu;Chandra Chekuri;Martin Pál;Jan Vondrák

  • Approximation Algorithms for Directed Steiner Problems

    Moses Charikar;Chandra Chekuri;To-yat Cheung;Zuo Dai

  • A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

    Chandra Chekuri;Sanjeev Khanna

  • A PTAS for the multiple knapsack problem

    Chandra Chekuri;Sanjeev Khanna

  • Conjunctive query containment revisited

    Chandra Chekuri;Anand Rajaraman

  • Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

    D. Aingworth;C. Chekuri;P. Indyk;R. Motwani

  • Maximizing a Submodular Set Function subject to a Matroid Constraint

    Chandra Chekuri;Gruia Calinescu;Martin Pál;Jan Vondrák

  • Improved algorithms for orienteering and related problems

    Chandra Chekuri;Nitish Korula;Martin Pál

  • A recursive greedy algorithm for walks in directed graphs

    Chandra Chekuri;M. Pal

  • Approximation Techniques for Average Completion Time Scheduling

    C. Chekuri;R. Motwani;B. Natarajan;C. Stein

  • Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

    Chandra Chekuri;Jan Vondrák;Rico Zenklusen;Rico Zenklusen

  • Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

    Chandra Chekuri;Jan Vondrak;Rico Zenklusen

  • Maximum Coverage Problem with Group Budget Constraints and Applications

    Chandra Chekuri;Amit Kumar

  • On Multidimensional Packing Problems

    Chandra Chekuri;Sanjeev Khanna

  • Approximation schemes for minimizing average weighted completion time with release dates

    F. Afrati;E. Bampis;C. Chekuri;D. Karger

  • Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

    Gruia Calinescu;Chandra Chekuri;Martin Pál;Jan Vondrák

  • Approximating a finite metric by a small number of tree metrics

    M. Charikar;C. Chekuri;A. Goel;S. Guha

  • On multi-dimensional packing problems

    Chandra Chekuri;Sanjeev Khanna

  • Approximation Algorithms for the Unsplittable Flow Problem

    Amit Chakrabarti;Chandra Chekuri;Anupam Gupta;Amit Kumar

  • Fast estimation of diameter and shortest paths (without matrix multiplication)

    D. Aingworth;C. Chekuri;R. Motwani

Frequent Co-Authors

Sanjeev Khanna
Sanjeev Khanna University of Pennsylvania
Jan Vondrák
Jan Vondrák Stanford University
Rajeev Motwani
Rajeev Motwani Stanford University
Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Anupam Gupta
Anupam Gupta Carnegie Mellon University
Julia Chuzhoy
Julia Chuzhoy Toyota Technological Institute at Chicago
Sudipto Guha
Sudipto Guha University of Pennsylvania
Moses Charikar
Moses Charikar Stanford University
Emina Soljanin
Emina Soljanin Rutgers, The State University of New Jersey
Christina Fragouli
Christina Fragouli University of California, Los Angeles

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 online education opens a wide range of flexible options for students interested in Computer Science and related fields. Choosing the best degrees can set the foundation for a successful tech career, whether you pursue a traditional or non-traditional study path. Many learners are also considering easy masters programs to get into for rapid career advancement or transitioning to new roles in technology.

For those aiming at the highest level of academic achievement with budget in mind, seeking out the cheapest online PhD programs is a smart strategy. Doctorate programs in Computer Science or education technology are now more accessible and affordable thanks to respected universities offering online options. Similarly, professionals in education or leadership roles might consider online EdD programs for rapid progress toward earning an advanced credential in a shorter time.

Whether you’re looking to specialize further, change your career path, or accelerate your learning, these related online degree pathways can provide valuable opportunities to grow in the dynamic field of Computer Science.

Best Scientists Citing Chandra Chekuri

Trending Scientists

Recently Published Articles