Conference An FPT algorithm beating 2-approximation for k-cut 2018 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 2821-2837 Gupta A, Lee E, Li J
Conference Faster Exact and Approximate Algorithms for k-cut 2018 • Annual Symposium on Foundations of Computer Science • 113-123 Gupta A, Lee E, Li J
Preprint Fully-Dynamic Bin Packing with Limited Repacking 2018 Gupta A, Guruganesh G, Kumar A, Wajc D
Conference Fully-dynamic bin packing with little repacking 2018 • Leibniz International Proceedings in Informatics • 107: Feldkord B, Feldotto M, Gupta A, Guruganesh G, Kumar A, Riechers S, Wajc D
Conference Maximizing profit with convex costs in the random-order model 2018 • Leibniz International Proceedings in Informatics • 107: Gupta A, Mehta R, Molinaro M
Conference Metric Embedding via Shortest Path Decompositions 2018 • Annual ACM Symposium on Theory of Computing • 952-963 Abraham I, Filtser A, Gupta A, Neiman O
Conference Non-preemptive flow-time minimization via rejections 2018 • Leibniz International Proceedings in Informatics • 107: Gupta A, Kumar A, Li J
Conference ON THE LOVASZ THETA FUNCTION FOR INDEPENDENT SETS IN SPARSE GRAPHS 2018 • SIAM journal on computing (Print) • 47(3):1039-1055 Bansal N, Gupta A, Guruganesh G
Conference Stochastic Load Balancing on Unrelated Machines 2018 • SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 1274-1285 Gupta A, Kumar A, Nagarajan V, Shen X
Conference Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions 2017 • PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 1688-1702 Gupta A, Nagarajan V, Singla S
Journal Article Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems 2017 • Mathematics of Operations Research • 42(3):876-896 Gupta A, Nagarajan V, Ravi R
Preprint Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems 2017 Gupta A, Nagarajan V, Ravi R
Conference LAST but not Least: Online Spanners for Buy-at-Bulk 2017 • PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 589-599 Gupta A, Ravi R, Talwar K, Umboh SW
Conference Online and Dynamic Algorithms for Set Cover 2017 • Annual ACM Symposium on Theory of Computing • 537-550 Gupta A, Krishnaswamy R, Kumar A, Panigrahi D
Conference Stochastic Unsplittable Flows 2017 • Leibniz International Proceedings in Informatics • 81: Gupta A, Karandikar A
Conference Algorithms and Adaptivity Gaps for Stochastic Probing 2016 1731-1747 Gupta A, Nagarajan V, Singla S
Journal Article Algorithms for Hub Label Optimization 2016 • ACM Transactions on Algorithms (TALG) • 13(1): Babenko M, Goldberg AV, Gupta A, Nagarajan V
Journal Article An Improved Integrality Gap for Asymmetric TSP Paths 2016 • Mathematics of Operations Research • 41(3):745-757 Friggstad Z, Gupta A, Singh M
Conference Approximation algorithms for aversion k-clustering via local k-median 2016 • Leibniz International Proceedings in Informatics • 55: Gupta A, Guruganesh G, Schmidt M
Conference How the Experts Algorithm Can Help Solve LPs Online 2016 • Mathematics of Operations Research • 41(4):1404-1431 Gupta A, Molinaro M
Preprint LAST but not Least: Online Spanners for Buy-at-Bulk 2016 Gupta A, Ravi R, Talwar K, Umboh SW
Conference On Hierarchical Routing in Doubling Metrics 2016 • ACM Transactions on Algorithms (TALG) • 12(4): Chan T-HH, Gupta A, Maggs BM, Zhou S
Conference Online Algorithms for Covering and Packing Problems with Convex Objectives 2016 • Annual Symposium on Foundations of Computer Science • 148-157 Azar Y, Buchbinder N, Chan T-HH, Chen S, Cohen IR, Gupta A, Huang Z, Kang N, Nagarajan V, Naor JS, Panigrahi D
Preprint Online and Dynamic Algorithms for Set Cover 2016 Gupta A, Krishnaswamy R, Kumar A, Panigrahi D
Conference Pure Exploration of Multi-armed Bandit under Matroid Constraints 2016 • Journal of machine learning research • 49:647-669 Chen L, Gupta A, Li J
