Chandra Sekhar Chekuri

Chandra Sekhar Chekuri
Chandra Sekhar Chekuri
Paul and Cynthia Saylor Professor
(217) 265-0705
3228 Siebel Center for Comp Sci

For More Information

Education

  • Ph.D. in Computer Science, Stanford University 1998
  • B. Tech in 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, 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\'ak : Maximizing a Monotone Submodular Function subject to a Matroid Constraint, SIAM Journal  on Computing, 40(6):1740--1766. Published online, Dec 2011.
  • Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. 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

  • Associate Editor, SIAM Journal on Computing, Jan 2021 - present
  • 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

Recent Courses Taught

  • CS 374 AL1 (CS 374 AYA, CS 374 AYB, CS 374 AYC, CS 374 AYD, CS 374 AYE, CS 374 AYF, CS 374 AYG, CS 374 AYH, CS 374 AYJ, CS 374 AYK, CS 374 ADA, CS 374 ADB, CS 374 ADC, CS 374 ADD, CS 374 ADE, CS 374 ADF, CS 374 ADG, CS 374 ADH, CS 374 ADJ, CS 374 ADK, CS 374 BL1, CS 374 BYA, CS 374 BYB, CS 374 BYC, ECE 374 ADA, ECE 374 ADB, ECE 374 ADC, ECE 374 ADD, ECE 374 ADE, ECE 374 ADF, ECE 374 ADG, ECE 374 ADH, ECE 374 ADJ, ECE 374 ADK, ECE 374 AL1, ECE 374 AYA, ECE 374 AYB, ECE 374 AYC, ECE 374 AYD, ECE 374 AYE, ECE 374 AYF, ECE 374 AYG, ECE 374 AYH, ECE 374 AYJ, ECE 374 AYK, ECE 374 BL1, ECE 374 BYA, ECE 374 BYB, ECE 374 BYC) - Intro to Algs & Models of Comp
  • CS 473 (CSE 414, MATH 473) - Algorithms
  • CS 498 ABD (CS 498 ABG, CS 498 ABU) - Algorithms for Big Data
  • CS 583 - Approximation Algorithms
  • CS 598 CCI - Topics in Graph Algorithms
  • IE 519 (CS 586) - Combinatorial Optimization