Shuchi Chawla

Papers

Total Citations

372

H-Index

About

Shuchi Chawla is a leading figure in theoretical computer science, renowned for her groundbreaking work in approximation algorithms, algorithmic game theory, and mechanism design. Her research masterfully tackles complex optimization problems, particularly those involving routing, scheduling, and resource allocation under uncertainty. Chawla’s most celebrated contribution is her pioneering work on the Orienteering problem, where she and her co-authors delivered the first constant-factor approximation algorithm—a result that has garnered over 370 citations across two seminal papers. This work, which also introduced the Discounted-Reward Traveling Salesman Problem, was directly motivated by challenges in robot navigation and has profoundly influenced subsequent research in path planning and prize-collecting problems. Beyond routing, Chawla has made significant strides in understanding the power of simple mechanisms, such as sequential posted pricing, and in the analysis of Bayesian incentive compatibility. Her deep, elegant results have earned her a place as a Professor at the University of Texas at Austin and a reputation for solving some of the field’s most stubborn problems.