Anupam Gupta

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 145

Top Venues

Publications

Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206 (1) (2024)
Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi
Max-Cut with ε-Accurate Predictions. CoRR (2024)
Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin
Pairwise-Independent Contention Resolution. CoRR (2024)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
-Taxi Problem. SODA (2024)
Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin
Pairwise-Independent Contention Resolution. IPCO (2024)
Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
Maintaining Matroid Intersections Online. SODA (2024)
Hanseul Cho, Jaeyoung Cha, Pranjal Awasthi, Srinadh Bhojanapalli, Anupam Gupta, Chulhee Yun
Position Coupling: Leveraging Task Structure for Improved Length Generalization of Transformers. CoRR (2024)
Anupam Gupta, Gregory Kehne, Roie Levin
Set Covering with Our Eyes Wide Shut. SODA (2024)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. 72 (3) (2024)
Zohar Barak, Anupam Gupta, Inbal Talgam-Cohen
MAC Advice for Facility Location Mechanism Design. CoRR (2024)
Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
The Price of Explainability for Clustering. FOCS (2023)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM (2023)
Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
Maintaining Matroid Intersections Online. CoRR (2023)
Pranjal Awasthi, Anupam Gupta
Improving Length-Generalization in Transformers via Task Hinting. CoRR (2023)
C. J. Argue, Anupam Gupta, Marco Molinaro
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. 70 (3) (2023)
Anupam Gupta, Euiwoong Lee, Jason Li
A Local Search-Based Approach for Set Covering. SOSA (2023)
Anupam Gupta, Benjamin Moseley, Rudy Zhou
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. SODA (2023)
Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhouzi Li
Graph Searching with Predictions. ITCS (2023)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52 (5) (2023)
Anupam Gupta, Gregory Kehne, Roie Levin
Set Covering with Our Eyes Wide Shut. CoRR (2023)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR (2023)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. IPCO (2023)
Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhouzi Li
Graph Searching with Predictions. CoRR (2022)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51 (2) (2022)
Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
-cut Problem. J. ACM 69 (1) (2022)
Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
Configuration Balancing for Stochastic Requests. CoRR (2022)
Anupam Gupta, Gregory Kehne, Roie Levin
Random Order Online Set Cover is as Easy as Offline. FOCS (2022)
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
An Improved Local Search Algorithm for k-Median. SODA (2022)
C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler
Learning from a Sample in Online Algorithms. NeurIPS (2022)
Anupam Gupta, Benjamin Moseley, Rudy Zhou
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. CoRR (2022)
Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun
Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS (2022)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. SODA (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS (2022)
Anupam Gupta, Euiwoong Lee, Jason Li
A Local Search-Based Approach for Set Covering. CoRR (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with Time Windows and Delays. SIAM J. Comput. 51 (4) (2022)
Anupam Gupta
Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). FSTTCS (2022)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic makespan minimization in structured set systems. Math. Program. 192 (1) (2022)
C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA (2022)
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO (2022)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. CoRR (2021)
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR (2021)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. CoRR (2021)
C. J. Argue, Anupam Gupta, Ziye Tang, Guru Guruganesh
Chasing Convex Bodies with Linear Competitive Ratio. J. ACM 68 (5) (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR (2021)
Anupam Gupta, Amit Kumar, Sahil Singla
Bag-of-Tasks Scheduling on Related Machines. CoRR (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. ICML (2021)
C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
Chasing convex bodies with linear competitive ratio (invited paper). STOC (2021)
Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
)-approximation for planar sparsest cut. STOC (2021)
Bailey Flanigan, Paul Gölz, Anupam Gupta, Brett Hennig, Ariel D. Procaccia
Fair algorithms for selecting citizens' assemblies. Nat. 596 (7873) (2021)
Anupam Gupta, Benjamin Moseley, Rudy Zhou
Structural Iterative Rounding for Generalized k-Median Problems. ICALP (2021)
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
An Improved Local Search Algorithm for k-Median. CoRR (2021)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS (2021)
Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut. CoRR (2021)
Anupam Gupta, Gregory Kehne, Roie Levin
Random Order Set Cover is as Easy as Offline. CoRR (2021)
Anupam Gupta, Gregory Kehne, Roie Levin
Random Order Online Set Cover is as Easy as Offline. FOCS (2021)
Anupam Gupta, Euiwoong Lee, Jason Li
The Connectivity Threshold for Dense Graphs. SODA (2021)
Anupam Gupta, Amit Kumar, Sahil Singla
Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM (2021)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. 46 (1) (2021)
C. J. Argue, Anupam Gupta, Marco Molinaro
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR (2021)
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
The Power of Adaptivity for Stochastic Submodular Cover. CoRR (2021)
C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR (2021)
Anupam Gupta, Roie Levin
Fully-Dynamic Submodular Cover with Bounded Recourse. CoRR (2020)
Anupam Gupta, Roie Levin
Fully-Dynamic Submodular Cover with Bounded Recourse. FOCS (2020)
Anupam Gupta, Roie Levin
The Online Submodular Cover Problem. SODA (2020)
C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
Chasing Convex Bodies with Linear Competitive Ratio. SODA (2020)
Anupam Gupta, Benjamin Moseley, Rudy Zhou
Structural Iterative Rounding for Generalized k-Median Problems. CoRR (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling Using Expander Decompositions. FSTTCS (2020)
C. J. Argue, Anupam Gupta, Guru Guruganesh
Dimension-Free Bounds on Chasing Convex Functions. CoRR (2020)
Bailey Flanigan, Paul Gölz, Anupam Gupta, Ariel D. Procaccia
Neutralizing Self-Selection Bias in Sampling for Sortition. CoRR (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems. CoRR (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO (2020)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with Time Windows and Delays. CoRR (2020)
Anupam Gupta, Euiwoong Lee, Jason Li
The Karger-Stein algorithm is optimal for k-cut. STOC (2020)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with time windows. STOC (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling using Expander Decompositions. CoRR (2020)
Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
Optimal Bounds for the k-cut Problem. CoRR (2020)
Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic
Robust Algorithms for the Secretary Problem. ITCS (2020)
C. J. Argue, Anupam Gupta, Guru Guruganesh
Dimension-Free Bounds for Chasing Convex Functions. COLT (2020)
Anupam Gupta, Sahil Singla
Random-Order Models. CoRR (2020)
Bailey Flanigan, Paul Gölz, Anupam Gupta, Ariel D. Procaccia
Neutralizing Self-Selection Bias in Sampling for Sortition. NeurIPS (2020)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
k-Servers with a Smile: Online Algorithms via Projections. SODA (2019)
Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc
Stochastic Online Metric Matching. ICALP (2019)
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
Tight FPT Approximations for $k$-Median and k-Means. CoRR (2019)
Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33 (1) (2019)
Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla
The Markovian Price of Information. CoRR (2019)
Anupam Gupta, Euiwoong Lee, Jason Li
The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR (2019)
Anupam Gupta, Euiwoong Lee, Jason Li
-cuts: improving the Karger-Stein bound. STOC (2019)
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
Tight FPT Approximations for k-Median and k-Means. ICALP (2019)
Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
Non-clairvoyant Precedence Constrained Scheduling. CoRR (2019)
C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
Chasing Convex Bodies with Linear Competitive Ratio. CoRR (2019)
Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic
Robust Algorithms for the Secretary Problem. CoRR (2019)
Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc
Stochastic Online Metric Matching. CoRR (2019)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Elastic Caching. SODA (2019)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48 (3) (2019)
Anupam Gupta, Euiwoong Lee, Jason Li
The Karger-Stein Algorithm is Optimal for k-cut. CoRR (2019)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. CoRR (2019)
Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla
The Markovian Price of Information. IPCO (2019)
Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
Non-Clairvoyant Precedence Constrained Scheduling. ICALP (2019)
Nikhil Bansal, Anupam Gupta
Potential-Function Proofs for Gradient Methods. Theory Comput. 15 (2019)

Anupam Gupta.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anupam Gupta