Articles by Chandra Chekuri
 Vol 18, Article 18 (pp 1-19) Algorithms for Intersection Graphs for $t$-Intervals and $t$-Pseudodisks
 Vol 16, Article 14 (pp 1-8) [NOTE] On the Hardness of Approximating the $k$-Way Hypergraph Cut problem by Chandra Chekuri and Shi Li
 Vol 8, Article 7 (pp 165-195) [Motwani Special Issue] Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
 Vol 3, Article 10 (pp 197-209) An   O(log n)   Approximation Ratio for the Asymmetric Traveling Salesman Path Problem by Chandra Chekuri and Martin Pál ■
 Vol 2, Article 7 (pp 137-146) An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow