Chandra Chekuri
Paul and Cynthia Saylor Professor
(217) 265-0705
3228 Thomas M. Siebel Center for Computer Science
For More Information
Education
- Ph.D., Computer Science, Stanford University,1998
- B. Tech, Computer Science, Indian Institute of Technology, Madras,1993
Research Areas
Selected Articles in Journals
- Chandra Chekuri and Chao Xu, Minimum Cuts and Sparsification in Hypergraphs, SIAM Journal on Computing, 47(6), 2118-2156, 2018.
- Chandra Chekuri and Julia Chuzhoy, Polynomial bounds for the grid-minor theorem, Journal of the ACM, 40:1-40:65, 2016.
- Chandra Chekuri, Sreeram Kannan, Adnan Raja and Pramod Viswanath. Multicommodity Flows and Cuts in Polymatroidal Networks, SIAM Journal on Computing, 44(4): 912 - 943, 2015.
- Chandra Chekuri, Jan Vondrak and Rico Zenklusen, Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes, SIAM Journal on Computing, 43(6): 1831-1879, 2014.
- G. C\'alinescu, C. Chekuri, M. Pal and J. Vondrák, Maximizing a Monotone Submodular Function subject to a Matroid Constraint, SIAM Journal on Computing, 40(6):1740--1766, Dec 2011.
- Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd, Edge-Disjoint Paths in Planar Graphs with Constant Congestion, SIAM Journal of Computing 39(1): 281-301, 2009.
- C. Chekuri and S. Khanna, A PTAS for the Multiple Knapsack Problem, SIAM Journal on Computing, 35(3): pp. 713-728, 2006.
Journal Editorships
- Editor-in-Chief, SIAM Journal on Computing, May 2025 - present
- Associate Editor, SIAM Journal on Computing, Jan 2021 - May 2025
- Associate Editor, Mathematics of Operations Research, March 2013 - Jan 2019
- Associate Editor, Mathematical Programming Ser A, Jan 2009 - Jan 2016
Conferences Organized or Chaired
- Program Committee Chair, ACM-SIAM SODA, 2014
- Program Committee Chair, APPROX, 2005
Research Honors
- ACM Fellow (2024)