Chandra Chekuri

10.0k total citations · 1 hit paper
130 papers, 4.6k citations indexed

About

Chandra Chekuri is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Industrial and Manufacturing Engineering. According to data from OpenAlex, Chandra Chekuri has authored 130 papers receiving a total of 4.6k indexed citations (citations by other indexed papers that have themselves been cited), including 91 papers in Computational Theory and Mathematics, 75 papers in Computer Networks and Communications and 27 papers in Industrial and Manufacturing Engineering. Recurrent topics in Chandra Chekuri's work include Complexity and Algorithms in Graphs (86 papers), Advanced Graph Theory Research (68 papers) and Optimization and Search Problems (56 papers). Chandra Chekuri is often cited by papers focused on Complexity and Algorithms in Graphs (86 papers), Advanced Graph Theory Research (68 papers) and Optimization and Search Problems (56 papers). Chandra Chekuri collaborates with scholars based in United States, Germany and Israel. Chandra Chekuri's co-authors include Sanjeev Khanna, Martin Pál, J. Vondrák, Moses Charikar, Gruiă Cälinescu, Rajeev Motwani, F. Bruce Shepherd, Ashish Goel, Tomás Feder and Rico Zenklusen and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Journal on Selected Areas in Communications and Journal of the ACM.

In The Last Decade

Chandra Chekuri

127 papers receiving 4.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

2011 390 citations Gruiă Cälinescu, Chandra Chekuri et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Chandra Chekuri United States	36	2.7k	2.0k	864	819	572	130	4.6k
Sanjeev Khanna United States	37	2.9k 1.0×	1.7k 0.9×	1.2k 1.4×	592 0.7×	424 0.7×	180	4.8k
Samir Khuller United States	32	3.7k 1.3×	2.0k 1.0×	791 0.9×	647 0.8×	1.1k 1.9×	167	6.1k
David P. Williamson United States	35	2.4k 0.9×	2.9k 1.5×	1.1k 1.3×	1.2k 1.5×	814 1.4×	102	6.0k
Toshihide Ibaraki Japan	40	1.7k 0.6×	2.1k 1.1×	1.4k 1.6×	1.9k 2.4×	515 0.9×	266	5.9k
Harold N. Gabow United States	35	1.9k 0.7×	2.3k 1.2×	813 0.9×	512 0.6×	724 1.3×	118	4.7k
Michel X. Goemans United States	33	1.9k 0.7×	2.7k 1.4×	1.1k 1.2×	1.2k 1.4×	856 1.5×	79	5.4k
Baruch Schieber United States	33	2.0k 0.7×	1.2k 0.6×	786 0.9×	453 0.6×	564 1.0×	129	3.5k
Howard Karloff United States	29	1.3k 0.5×	1.2k 0.6×	957 1.1×	428 0.5×	274 0.5×	91	2.9k
Nikhil Bansal United States	27	2.2k 0.8×	684 0.4×	616 0.7×	773 0.9×	614 1.1×	148	3.7k
Allan Borodin Canada	33	2.9k 1.1×	2.0k 1.0×	1.4k 1.6×	484 0.6×	584 1.0×	105	5.2k

Countries citing papers authored by Chandra Chekuri

Since Specialization

Citations

This map shows the geographic impact of Chandra Chekuri's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chandra Chekuri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chandra Chekuri more than expected).

Fields of papers citing papers by Chandra Chekuri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chandra Chekuri. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chandra Chekuri. The network helps show where Chandra Chekuri may publish in the future.

Co-authorship network of co-authors of Chandra Chekuri

This figure shows the co-authorship network connecting the top 25 collaborators of Chandra Chekuri. A scholar is included among the top collaborators of Chandra Chekuri based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chandra Chekuri. Chandra Chekuri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Chekuri, Chandra, et al.. (2024). On submodular prophet inequalities and correlation gap. Theoretical Computer Science. 1019. 114814–114814. 1 indexed citations

Chekuri, Chandra, et al.. (2023). Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions. COMBINATORICA. 43(3). 455–477.

Chekuri, Chandra & Kent Quanrud. (2021). Faster Algorithms for Rooted Connectivity in Directed Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Chekuri, Chandra & Kent Quanrud. (2021). Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20. 2 indexed citations

Chekuri, Chandra, Kent Quanrud, & Chao Xu. (2019). LP Relaxation and Tree Packing for Minimum k-cuts. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Chekuri, Chandra, et al.. (2018). Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Chekuri, Chandra & Chao Xu. (2017). Computing minimum cuts in hypergraphs. Symposium on Discrete Algorithms. 1085–1100. 4 indexed citations

Chekuri, Chandra & Julia Chuzhoy. (2016). Polynomial Bounds for the Grid-Minor Theorem. Journal of the ACM. 63(5). 1–65. 30 indexed citations

Chekuri, Chandra, Jan Vondrák, & Rico Zenklusen. (2011). Multi-budgeted matchings and matroid intersection via dependent rounding. Symposium on Discrete Algorithms. 1080–1097. 24 indexed citations

10.

Chekuri, Chandra & Jan Vondrák. (2009). Randomized Pipage Rounding for Matroid Polytopes and Applications. arXiv (Cornell University). 13 indexed citations

11.

Chekuri, Chandra, Mohammad Taghi Hajiaghayi, Guy Kortsarz, & Mohammad R. Salavatipour. (2007). Approximation algorithms for node-weighted buy-at-bulk network design. Symposium on Discrete Algorithms. 1265–1274. 19 indexed citations

12.

Chekuri, Chandra, Gruiă Cälinescu, Martin Pál, & J. Vondrák. (2007). Maximizing a Submodular Set Function subject to a Matroid Constraint. 182–196. 136 indexed citations

13.

Chekuri, Chandra, Christina Fragouli, & Emina Soljanin. (2005). On Average Throughput Benefits and Alphabet Size in Network Coding. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1593–1597. 6 indexed citations

14.

Chekuri, Chandra, Klaus Jansen, Andrea Roli, & Luca Trevisan. (2005). Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings. Springer eBooks. 1 indexed citations

15.

Chekuri, Chandra, Sanjeev Khanna, & Joseph Naor. (2001). A deterministic algorithm for the cost-distance problem. Symposium on Discrete Algorithms. 232–233. 27 indexed citations

16.

Chekuri, Chandra, Sanjeev Khanna, Joseph Naor, & Leonid Zosin. (2001). Approximation algorithms for the metric labeling problem via a new linear programming formulation. Symposium on Discrete Algorithms. 109–118. 68 indexed citations

17.

Chekuri, Chandra & Sanjeev Khanna. (2000). A PTAS for the multiple knapsack problem. Symposium on Discrete Algorithms. 213–222. 171 indexed citations

18.

Charikar, Moses, Chandra Chekuri, To-Yat Cheung, et al.. (1998). Approximation algorithms for directed Steiner problems. Symposium on Discrete Algorithms. 192–200. 85 indexed citations

19.

Chekuri, Chandra & Anand Rajaraman. (1997). Conjunctive query containment revisited: Extended Abstract. 56–70. 10 indexed citations

20.

Chekuri, Chandra, et al.. (1996). Profile-driven instruction level parallel scheduling with application to super blocks. International Symposium on Microarchitecture. 58–67. 24 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact