World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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