Conference Multiclass learning, boosting, and error-correcting codes 1999 • Proceedings of the Annual ACM Conference on Computational Learning Theory • 145-155 Guruswami V, Sahai A
Journal Article Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems 1999 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 19-28 Guruswami V, Khanna S, Rajaraman R, Shepherd B, Yannakakis M
Journal Article A natural family of optimization problems with arbitrarily small approximation thresholds 1998 • Information Processing Letters • 68(5):241-248 Guruswami V, Rangan CP
Conference Improved decoding of Reed-Solomon and algebraic-geometric codes 1998 • Annual Symposium on Foundations of Computer Science • 28-37 Guruswami V, Sudan M
Journal Article The vertex-disjoint triangles problem 1998 • Lecture Notes in Computer Science • 1517:26-37 Guruswami V, Rangan CP, Chang MS, Chang GJ, Wong CK
Conference Tight characterization of NP with 3 query PCPs 1998 • Annual Symposium on Foundations of Computer Science • 8-17 Guruswami V, Lewin D, Sudan M, Trevisan L
Journal Article Restrictions of Minimum Spanner Problems 1997 • Information and Computation • 136(2):143-164 Venkatesan G, Rotics U, Madanlal MS, Makowsky JA, Pandu Rangan C
Journal Article Approximate triclique coloring for register allocation 1996 • Information Processing Letters • 60(5):249-253 Venkatesan G, Rangan CP
Journal Article Tree 3-spanners on interval, permutation and regular bipartite graphs 1996 • Information Processing Letters • 59(2):97-102 Madanlal MS, Venkatesan G, Pandu Rangan C
