Chandra Sekhar Chekuri

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 (ECE 374) - Intro to Algs & Models of Comp
• CS 473 (CSE 414, MATH 473) - Algorithms
• CS 498 ABD (CS 498 ABG, CS 498 BDA, CS 498 BDB, CS 498 BDC, CS 498 BDD, CS 498 BDE, CS 498 BDF, CS 498 BDG, CS 498 BDH, CS 498 BDI, CS 498 BDJ, CS 498 BL1, CS 498 DL1) - Theory II
• CS 583 - Approximation Algorithms
• CS 591 PHD (CS 591 TA) - Teaching Assistant Training
• CS 598 CCI - Topics in Graph Algorithms
• IE 519 (CS 586) - Combinatorial Optimization