Conference Counting inversions in lists 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 253-254 Gupta A, Zane FX
Conference Embedding k-outerplanar graphs into ℓ<inf>1</inf> 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 527-536 Chekuri C, Gupta A, Newman I, Rabinovich Y, Sinclair A
Conference Exploring the trade-off between label size and stack depth in MPLS routing 2003 • IEEE Infocom. Proceedings • 544-554 Gupta A, Kumar A, Rastogi R
Conference Improved results for directed multicut 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 454-455 Gupta A
Conference Lower bounds for embedding edit distance into normed spaces 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 523-526 Andoni A, Deza M, Gupta A, Indyk P, Raskhodnikova S
Journal Article On the covering Steiner problem 2003 • Lecture Notes in Computer Science • 2914:244-251 Gupta A, Srinivasan A
Conference Simpler and better approximation algorithms for network design 2003 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 365-372 Gupta A, Kumar A, Roughgarden T
Conference A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem 2002 • Annual Symposium on Foundations of Computer Science • 333-342 Kumar A, Gupta A, Roughgarden T
Conference Approximation Algorithms for the Unsplittable Flow Problem 2002 • Lecture Notes in Computer Science • 2462:51-66 Chakrabarti A, Chekuri C, Gupta A, Kumar A
Conference Building Edge-Failure Resilient Networks 2002 • Lecture Notes in Computer Science • 2337:439-456 Chekuri C, Gupta A, Kumar A, Naor JS, Raz D
Journal Article Broadcasting in complete and incomplete star interconnection networks 2001 • Computer Systems Science and Engineering • 16(4):205-213 Gupta B, Ghosh K, Dutta D, Gupta A
Journal Article Improved Bandwidth Approximation for Trees and Chordal Graphs 2001 • Journal of Algorithms in Cognition, Informatics and Logic • 40(1):24-36 Gupta A
Conference Provisioning a virtual private network: a network design problem for multicommodity flow 2001 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 389-398 Gupta A, Kleinberg J, Kumar A, Rastogi R, Yener B
Conference Steiner points in tree metrics don't (really) help 2001 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 220-227 Gupta A
Conference A constant factor approximation algorithm for a class of classification problems 2000 • Annual ACM Symposium on Theory of Computing • 652-658 Gupta A, Tardos É
Journal Article Embedding Tree Metrics into Low-Dimensional Euclidean Spaces 2000 • Discrete and Computational Geometry • 24(1):105-116 Gupta A
Conference Improved bandwidth approximation for trees 2000 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 788-793 Gupta A
Conference Cuts, trees and l/sub 1/-embeddings of graphs 1999 • Annual Symposium on Foundations of Computer Science • 399-408 Gupta A, Newman I, Rabinovich Y, Sinclair A
Conference Cuts, trees and ℓ-embeddings of graphs (preliminary version) 1999 • Annual Symposium on Foundations of Computer Science • 399-408 Gupta A, Newman I, Rabinovich Y, Sinclair A
Journal Article Embedding tree metrics into low dimensional Euclidean spaces 1999 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 694-700 Gupta A
Conference Efficient broadcasting in incomplete star interconnection networks 1998 • Proceedings of the Joint Conference on Information Sciences • 3:62-65 Gupta A, Ghosh K, Dutta D, Gupta B
Chapter Connection establishment for multi-party real-time communication 1995 • Lecture Notes in Computer Science • 1018:240-250 Bettati R, Ferrari D, Gupta A, Heffner W, Howe W, Moran M, Nguyen Q, Yavatkar R
Journal Article Resource partitioning for real-time communication 1995 • IEEE/ACM Transactions on Networking • 3(5):501-508 Gupta A, Ferrari D
