Chandra Sekhar Chekuri

Chandra Sekhar Chekuri is the Paul and Cynthia Saylor Professor at the Siebel School of Computing and Data Science, University of Illinois at Urbana-Champaign. His research focuses on approximation algorithms, graph theory, and combinatorial optimization with applications in computer science and discrete mathematics. He has contributed to topics such as directed Steiner forests, feedback vertex sets, and network design.

Research interests include algorithm design for complex optimization problems, leveraging polyhedral combinatorics and approximation techniques. His recent work addresses challenges in planar digraphs, pseudoforests, and fair resource allocation. He has published influential papers in venues like SODA, AAAI, and ESA.

• Awards: ACM Fellow (2023)

His articles explore advanced theoretical concepts while maintaining practical relevance to network design and algorithmic efficiency. Collaborative work spans international teams addressing computational problems in discrete mathematics and optimization.