Anupam Gupta - RankMe

370 papers A* 120A 14B 20Misc 1Journal 177Unranked 35

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	A Learning Perspective on Random-Order Covering Problems. SOSA Anupam Gupta, Marco Molinaro, Matteo Russo
2026	J	`jnl`	A Simpler Analysis for ϵ-Clairvoyant Flow Time Scheduling. CoRR Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2026	A*	`conf`	An Optimal Online Algorithm for Robust Flow Time Scheduling. SODA Anupam Gupta, Amit Kumar, Debmalya Panigrahi, Zhaozi Wang
2026	J	`jnl`	Contextual Online Bilateral Trade. CoRR Romain Cosson, Federico Fusco, Anupam Gupta, Stefano Leonardi, Renato Paes Leme, Matteo Russo
2026	J	`jnl`	Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems. CoRR Sujoy Bhore, Anupam Gupta, Amit Kumar
2026	J	`jnl`	Learning Markov Decision Processes under Fully Bandit Feedback. CoRR Zhengjia Zhuo, Anupam Gupta, Viswanath Nagarajan
2026	A*	`conf`	Learning Packing and Covering from Samples. SODA Anupam Gupta, Marco Molinaro
2025	J	`jnl`	A Learning Perspective on Random-Order Covering Problems. CoRR Anupam Gupta, Marco Molinaro, Matteo Russo
2025	A*	`conf`	A Little Clairvoyance Is All You Need. FOCS Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025	J	`jnl`	A Little Clairvoyance Is All You Need. CoRR Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter, Sorrachai Yingchareonthawornchai
2025	J	`jnl`	Combinatorial Optimization using Comparison Oracles. CoRR Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Guru Guruganesh, Euiwoong Lee, Debmalya Panigrahi, Madhusudhan Reddy Pittu, Jon Schneider, David P. Woodruff
2025	B	`conf`	Complexity of Local Search for CSPs Parameterized by Constraint Difference. IPEC Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng
2025	J	`jnl`	Complexity of Local Search for CSPs Parameterized by Constraint Difference. CoRR Aditya Anand, Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi, Sijin Peng
2025	J	`jnl`	Configuration balancing for stochastic requests. Math. Program. Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2025	A*	`conf`	Multi-Platform Autobidding with and without Predictions. WWW Gagan Aggarwal, Anupam Gupta, Xizhi Tan, Mingfei Zhao
2025	J	`jnl`	Multi-Platform Autobidding with and without Predictions. CoRR Gagan Aggarwal, Anupam Gupta, Xizhi Tan, Mingfei Zhao
2025	J	`jnl`	Nonadaptive Stochastic Score Classification and Explainable Half-Space Evaluation. Oper. Res. Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2025	A*	`conf`	Online Algorithm Design Beyond the Worst Case (Invited Talk). ICALP Anupam Gupta
2025	J	`jnl`	Steiner Forest: A Simplified Better-Than-2 Approximation. CoRR Anupam Gupta, Vera Traub
2025	J	`jnl`	Structural iterative rounding for generalized k-median problems. Math. Program. Anupam Gupta, Benjamin Moseley, Rudy Zhou
2025	J	`jnl`	The Online Submodular Cover Problem. CoRR Anupam Gupta, Roie Levin
2025	A*	`conf`	Tight Results for Online Convex Paging. STOC Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2025	—	`conf`	Why is My Route Different Today? An Algorithm for Explaining Route Selection. ACDA Aaron Schild, Sreenivas Gollapudi, Anupam Gupta, Kostas Kollias, Ali Kemal Sinop
2025	J	`jnl`	Why is My Route Different Today? An Algorithm for Explaining Route Selection. CoRR Aaron Schild, Sreenivas Gollapudi, Anupam Gupta, Kostas Kollias, Ali Kemal Sinop
2024	A*	`conf`	Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems. NeurIPS Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi
2024	J	`jnl`	MAC Advice for Facility Location Mechanism Design. CoRR Zohar Barak, Anupam Gupta, Inbal Talgam-Cohen
2024	A*	`conf`	MAC Advice for facility location mechanism design. NeurIPS Zohar Barak, Anupam Gupta, Inbal Talgam-Cohen
2024	A*	`conf`	Maintaining Matroid Intersections Online. SODA Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
2024	J	`jnl`	Matroid-based TSP rounding for half-integral solutions. Math. Program. Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2024	J	`jnl`	Max-Cut with ε-Accurate Predictions. CoRR Vincent Cohen-Addad, Tommaso d'Orsi, Anupam Gupta, Euiwoong Lee, Debmalya Panigrahi
2024	B	`conf`	Pairwise-Independent Contention Resolution. IPCO Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin
2024	J	`jnl`	Pairwise-Independent Contention Resolution. CoRR Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin
2024	A*	`conf`	Poly-logarithmic Competitiveness for the SODA Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2024	A*	`conf`	Position Coupling: Improving Length Generalization of Arithmetic Transformers Using Task Structure. NeurIPS Hanseul Cho, Jaeyoung Cha, Pranjal Awasthi, Srinadh Bhojanapalli, Anupam Gupta, Chulhee Yun
2024	J	`jnl`	Position Coupling: Leveraging Task Structure for Improved Length Generalization of Transformers. CoRR Hanseul Cho, Jaeyoung Cha, Pranjal Awasthi, Srinadh Bhojanapalli, Anupam Gupta, Chulhee Yun
2024	A*	`conf`	Randomized Truthful Auctions with Learning Agents. NeurIPS Gagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris Velegkas
2024	J	`jnl`	Randomized Truthful Auctions with Learning Agents. CoRR Gagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris Velegkas
2024	A*	`conf`	Set Covering with Our Eyes Wide Shut. SODA Anupam Gupta, Gregory Kehne, Roie Levin
2024	A	`conf`	The Average-Value Allocation Problem. APPROX/RANDOM Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang
2024	J	`jnl`	The Average-Value Allocation Problem. CoRR Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, Di Wang
2024	J	`jnl`	The Power of Adaptivity for Stochastic Submodular Cover. Oper. Res. Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2023	—	`conf`	A Local Search-Based Approach for Set Covering. SOSA Anupam Gupta, Euiwoong Lee, Jason Li
2023	B	`conf`	Configuration Balancing for Stochastic Requests. IPCO Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2023	J	`jnl`	Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2023	A	`conf`	Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2023	J	`jnl`	Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2023	A	`conf`	Graph Searching with Predictions. ITCS Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhouzi Li
2023	J	`jnl`	Improving Length-Generalization in Transformers via Task Hinting. CoRR Pranjal Awasthi, Anupam Gupta
2023	J	`jnl`	Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. C. J. Argue, Anupam Gupta, Marco Molinaro
2023	J	`jnl`	Maintaining Matroid Intersections Online. CoRR Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
2023	A*	`conf`	Minimizing Completion Times for Stochastic Jobs via Batched Free Times. SODA Anupam Gupta, Benjamin Moseley, Rudy Zhou
2023	J	`jnl`	Set Covering with Our Eyes Wide Shut. CoRR Anupam Gupta, Gregory Kehne, Roie Levin
2023	A*	`conf`	The Price of Explainability for Clustering. FOCS Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
2023	J	`jnl`	The Price of Explainability for Clustering. CoRR Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
2022	J	`jnl`	A Local Search-Based Approach for Set Covering. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2022	—	`conf`	Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). FSTTCS Anupam Gupta
2022	A*	`conf`	An Improved Local Search Algorithm for k-Median. SODA Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
2022	A*	`conf`	Augmenting Online Algorithms with $\varepsilon$-Accurate Predictions. NeurIPS Anupam Gupta, Debmalya Panigrahi, Bernardo Subercaseaux, Kevin Sun
2022	J	`jnl`	Caching with Time Windows and Delays. SIAM J. Comput. Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2022	J	`jnl`	Configuration Balancing for Stochastic Requests. CoRR Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
2022	J	`jnl`	Graph Searching with Predictions. CoRR Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta, Zhouzi Li
2022	A*	`conf`	Learning from a Sample in Online Algorithms. NeurIPS C. J. Argue, Alan M. Frieze, Anupam Gupta, Christopher Seiler
2022	B	`conf`	Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2022	J	`jnl`	Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2022	J	`jnl`	Minimizing Completion Times for Stochastic Jobs via Batched Free Times. CoRR Anupam Gupta, Benjamin Moseley, Rudy Zhou
2022	B	`conf`	Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. IPCO Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2022	A*	`conf`	Online Discrepancy with Recourse for Vectors and Graphs. SODA Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2022	J	`jnl`	Optimal Bounds for the J. ACM Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2022	A	`conf`	Probing to Minimize. ITCS Weina Wang, Anupam Gupta, Jalani Williams
2022	A*	`conf`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2022	A*	`ed.`	STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022 STOC Stefano Leonardi, Anupam Gupta
2022	J	`jnl`	Stochastic makespan minimization in structured set systems. Math. Program. Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2021	A*	`conf`	A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2021	J	`jnl`	A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2021	J	`jnl`	A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut. CoRR Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
2021	A*	`conf`	A quasipolynomial (2 + STOC Vincent Cohen-Addad, Anupam Gupta, Philip N. Klein, Jason Li
2021	J	`jnl`	An Improved Local Search Algorithm for k-Median. CoRR Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
2021	—	`conf`	Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM Anupam Gupta, Amit Kumar, Sahil Singla
2021	J	`jnl`	Bag-of-Tasks Scheduling on Related Machines. CoRR Anupam Gupta, Amit Kumar, Sahil Singla
2021	J	`jnl`	Chasing Convex Bodies with Linear Competitive Ratio. J. ACM C. J. Argue, Anupam Gupta, Ziye Tang, Guru Guruganesh
2021	A*	`conf`	Chasing convex bodies with linear competitive ratio (invited paper). STOC C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2021	J	`jnl`	Fair algorithms for selecting citizens' assemblies. Nat. Bailey Flanigan, Paul Gölz, Anupam Gupta, Brett Hennig, Ariel D. Procaccia
2021	J	`jnl`	Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro
2021	J	`jnl`	Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
2021	J	`jnl`	Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation. CoRR Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2021	J	`jnl`	Online Discrepancy with Recourse for Vectors and Graphs. CoRR Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2021	J	`jnl`	Probing to Minimize. CoRR Weina Wang, Anupam Gupta, Jalani Williams
2021	A*	`conf`	Random Order Online Set Cover is as Easy as Offline. FOCS Anupam Gupta, Gregory Kehne, Roie Levin
2021	J	`jnl`	Random Order Set Cover is as Easy as Offline. CoRR Anupam Gupta, Gregory Kehne, Roie Levin
2021	J	`jnl`	Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
2021	J	`jnl`	Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2021	A*	`conf`	Structural Iterative Rounding for Generalized k-Median Problems. ICALP Anupam Gupta, Benjamin Moseley, Rudy Zhou
2021	A*	`conf`	The Connectivity Threshold for Dense Graphs. SODA Anupam Gupta, Euiwoong Lee, Jason Li
2021	A*	`conf`	The Power of Adaptivity for Stochastic Submodular Cover. ICML Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2021	J	`jnl`	The Power of Adaptivity for Stochastic Submodular Cover. CoRR Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
2020	J	`jnl`	Caching with Time Windows and Delays. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2020	A*	`conf`	Caching with time windows. STOC Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2020	A*	`conf`	Chasing Convex Bodies with Linear Competitive Ratio. SODA C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2020	A*	`conf`	Dimension-Free Bounds for Chasing Convex Functions. COLT C. J. Argue, Anupam Gupta, Guru Guruganesh
2020	J	`jnl`	Dimension-Free Bounds on Chasing Convex Functions. CoRR C. J. Argue, Anupam Gupta, Guru Guruganesh
2020	A*	`conf`	Fully-Dynamic Submodular Cover with Bounded Recourse. FOCS Anupam Gupta, Roie Levin
2020	J	`jnl`	Fully-Dynamic Submodular Cover with Bounded Recourse. CoRR Anupam Gupta, Roie Levin
2020	A*	`conf`	Neutralizing Self-Selection Bias in Sampling for Sortition. NeurIPS Bailey Flanigan, Paul Gölz, Anupam Gupta, Ariel D. Procaccia
2020	J	`jnl`	Neutralizing Self-Selection Bias in Sampling for Sortition. CoRR Bailey Flanigan, Paul Gölz, Anupam Gupta, Ariel D. Procaccia
2020	—	`conf`	Online Carpooling Using Expander Decompositions. FSTTCS Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2020	J	`jnl`	Online Carpooling using Expander Decompositions. CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2020	J	`jnl`	Optimal Bounds for the k-cut Problem. CoRR Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li
2020	—	`ch.`	Random-Order Models. Beyond the Worst-Case Analysis of Algorithms Anupam Gupta, Sahil Singla
2020	J	`jnl`	Random-Order Models. CoRR Anupam Gupta, Sahil Singla
2020	A	`conf`	Robust Algorithms for the Secretary Problem. ITCS Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic
2020	B	`conf`	Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2020	J	`jnl`	Stochastic Makespan Minimization in Structured Set Systems. CoRR Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2020	J	`jnl`	Structural Iterative Rounding for Generalized k-Median Problems. CoRR Anupam Gupta, Benjamin Moseley, Rudy Zhou
2020	A*	`conf`	The Karger-Stein algorithm is optimal for k-cut. STOC Anupam Gupta, Euiwoong Lee, Jason Li
2020	A*	`conf`	The Online Submodular Cover Problem. SODA Anupam Gupta, Roie Levin
2019	A*	`conf`	A Nearly-Linear Bound for Chasing Nested Convex Bodies. SODA C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee
2019	J	`jnl`	Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi
2019	A*	`conf`	Better Algorithms for Stochastic Bandits with Adversarial Corruptions. COLT Anupam Gupta, Tomer Koren, Kunal Talwar
2019	J	`jnl`	Better Algorithms for Stochastic Bandits with Adversarial Corruptions. CoRR Anupam Gupta, Tomer Koren, Kunal Talwar
2019	J	`jnl`	Chasing Convex Bodies with Linear Competitive Ratio. CoRR C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang
2019	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2019	A*	`conf`	Elastic Caching. SODA Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2019	A*	`conf`	Losing Treewidth by Separating Subsets. SODA Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2019	A*	`conf`	Non-Clairvoyant Precedence Constrained Scheduling. ICALP Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
2019	J	`jnl`	Non-clairvoyant Precedence Constrained Scheduling. CoRR Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
2019	J	`jnl`	Potential-Function Proofs for Gradient Methods. Theory Comput. Nikhil Bansal, Anupam Gupta
2019	J	`jnl`	Robust Algorithms for the Secretary Problem. CoRR Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic
2019	J	`jnl`	Stochastic Load Balancing on Unrelated Machines. CoRR Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2019	A*	`conf`	Stochastic Online Metric Matching. ICALP Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc
2019	J	`jnl`	Stochastic Online Metric Matching. CoRR Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc
2019	J	`jnl`	The Karger-Stein Algorithm is Optimal for k-cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	B	`conf`	The Markovian Price of Information. IPCO Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla
2019	J	`jnl`	The Markovian Price of Information. CoRR Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla
2019	J	`jnl`	The Number of Minimum k-Cuts: Improving the Karger-Stein Bound. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2019	A*	`conf`	The number of minimum STOC Anupam Gupta, Euiwoong Lee, Jason Li
2019	J	`jnl`	Tight FPT Approximations for $k$-Median and k-Means. CoRR Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2019	A*	`conf`	Tight FPT Approximations for k-Median and k-Means. ICALP Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2019	A*	`conf`	k-Servers with a Smile: Online Algorithms via Projections. SODA Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
2018	A	`conf`	A Local-Search Algorithm for Steiner Forest. ITCS Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2018	J	`jnl`	A Nearly-Linear Bound for Chasing Nested Convex Bodies. CoRR C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee
2018	A*	`conf`	An FPT Algorithm Beating 2-Approximation for SODA Anupam Gupta, Euiwoong Lee, Jason Li
2018	A*	`conf`	Faster Exact and Approximate Algorithms for k-Cut. FOCS Anupam Gupta, Euiwoong Lee, Jason Li
2018	J	`jnl`	Faster Exact and Approximate Algorithms for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2018	A*	`conf`	Fully-Dynamic Bin Packing with Little Repacking. ICALP Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc
2018	J	`jnl`	Losing Treewidth by Separating Subsets. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2018	A*	`conf`	Maximizing Profit with Convex Costs in the Random-order Model. ICALP Anupam Gupta, Ruta Mehta, Marco Molinaro
2018	J	`jnl`	Maximizing Profit with Convex Costs in the Random-order Model. CoRR Anupam Gupta, Ruta Mehta, Marco Molinaro
2018	A*	`conf`	Metric embedding via shortest path decompositions. STOC Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2018	A*	`conf`	Non-Preemptive Flow-Time Minimization via Rejections. ICALP Anupam Gupta, Amit Kumar, Jason Li
2018	J	`jnl`	Non-Preemptive Flow-Time Minimization via Rejections. CoRR Anupam Gupta, Amit Kumar, Jason Li
2018	J	`jnl`	On the Lovász Theta Function for Independent Sets in Sparse Graphs. SIAM J. Comput. Nikhil Bansal, Anupam Gupta, Guru Guruganesh
2018	A*	`conf`	Stochastic Load Balancing on Unrelated Machines. SODA Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2018	J	`jnl`	k-Servers with a Smile: Online Algorithms via Projections. CoRR Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
2017	J	`jnl`	A Local-Search Algorithm for Steiner Forest. CoRR Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2017	A*	`conf`	Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. SODA Anupam Gupta, Viswanath Nagarajan, Sahil Singla
2017	J	`jnl`	An FPT Algorithm Beating 2-Approximation for k-Cut. CoRR Anupam Gupta, Euiwoong Lee, Jason Li
2017	J	`jnl`	Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. Math. Oper. Res. Anupam Gupta, Viswanath Nagarajan, R. Ravi
2017	J	`jnl`	Fully-Dynamic Bin Packing with Limited Repacking. CoRR Anupam Gupta, Guru Guruganesh, Amit Kumar, David Wajc
2017	A*	`conf`	LAST but not Least: Online Spanners for Buy-at-Bulk. SODA Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
2017	J	`jnl`	Metric Embedding via Shortest Path Decompositions. CoRR Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2017	A*	`conf`	Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. COLT Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang
2017	J	`jnl`	Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration. CoRR Lijie Chen, Anupam Gupta, Jian Li, Mingda Qiao, Ruosong Wang
2017	A*	`conf`	Online and dynamic algorithms for set cover. STOC Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2017	J	`jnl`	Potential-Function Proofs for First-Order Methods. CoRR Nikhil Bansal, Anupam Gupta
2017	—	`conf`	Stochastic Unsplittable Flows. APPROX-RANDOM Anupam Gupta, Archit Karandikar
2016	J	`jnl`	Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions. CoRR Anupam Gupta, Viswanath Nagarajan, Sahil Singla
2016	A*	`conf`	Algorithms and Adaptivity Gaps for Stochastic Probing. SODA Anupam Gupta, Viswanath Nagarajan, Sahil Singla
2016	J	`jnl`	Algorithms for Hub Label Optimization. ACM Trans. Algorithms Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
2016	J	`jnl`	An Improved Integrality Gap for Asymmetric TSP Paths. Math. Oper. Res. Zachary Friggstad, Anupam Gupta, Mohit Singh
2016	A*	`conf`	Approximation Algorithms for Aversion k-Clustering via Local k-Median. ICALP Anupam Gupta, Guru Guruganesh, Melanie Schmidt
2016	J	`jnl`	How the Experts Algorithm Can Help Solve LPs Online. Math. Oper. Res. Anupam Gupta, Marco Molinaro
2016	J	`jnl`	LAST but not Least: Online Spanners for Buy-at-Bulk. CoRR Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
2016	J	`jnl`	On Hierarchical Routing in Doubling Metrics. ACM Trans. Algorithms T.-H. Hubert Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou
2016	A*	`conf`	Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi
2016	J	`jnl`	Online and Dynamic Algorithms for Set Cover. CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2016	A*	`conf`	Pure Exploration of Multi-armed Bandit Under Matroid Constraints. COLT Lijie Chen, Anupam Gupta, Jian Li
2016	J	`jnl`	Pure Exploration of Multi-armed Bandit Under Matroid Constraints. CoRR Lijie Chen, Anupam Gupta, Jian Li
2016	J	`jnl`	Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Trans. Algorithms Anupam Gupta, Viswanath Nagarajan, R. Ravi
2016	J	`jnl`	The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. SIAM J. Comput. Albert Gu, Anupam Gupta, Amit Kumar
2015	—	`conf`	A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs. APPROX-RANDOM Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein
2015	J	`jnl`	Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
2015	A*	`conf`	Greedy Algorithms for Steiner Forest. STOC Anupam Gupta, Amit Kumar
2015	A*	`conf`	On the Lovász Theta function for Independent Sets in Sparse Graphs. STOC Nikhil Bansal, Anupam Gupta, Guru Guruganesh
2015	J	`jnl`	On the Lovász Theta function for Independent Sets in Sparse Graphs. CoRR Nikhil Bansal, Anupam Gupta, Guru Guruganesh
2015	J	`jnl`	Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2014	J	`jnl`	A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2014	J	`jnl`	Approximating Sparse Covering Integer Programs Online. Math. Oper. Res. Anupam Gupta, Viswanath Nagarajan
2014	—	`conf`	Changing Bases: Multistage Optimization for Matroids and Matchings. ICALP (1) Anupam Gupta, Kunal Talwar, Udi Wieder
2014	J	`jnl`	Changing Bases: Multistage Optimization for Matroids and Matchings. CoRR Anupam Gupta, Kunal Talwar, Udi Wieder
2014	A*	`conf`	Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2014	J	`jnl`	Greedy Algorithms for Steiner Forest. CoRR Anupam Gupta, Amit Kumar
2014	A	`conf`	How Experts Can Solve LPs Online. ESA Anupam Gupta, Marco Molinaro
2014	J	`jnl`	How the Experts Algorithm Can Help Solve LPs Online. CoRR Anupam Gupta, Marco Molinaro
2014	A*	`conf`	Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA Anupam Gupta, Amit Kumar, Cliff Stein
2014	A*	`conf`	Minimum SODA Anupam Gupta, Anastasios Sidiropoulos
2014	J	`jnl`	Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2014	J	`jnl`	Online Packing and Covering Framework with Convex Objectives. CoRR Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
2014	A*	`conf`	Online Steiner Tree with Deletions. SODA Anupam Gupta, Amit Kumar
2014	J	`jnl`	Thresholded covering algorithms for robust and max-min optimization. Math. Program. Anupam Gupta, Viswanath Nagarajan, R. Ravi
2014	A*	`conf`	Towards (1 + SODA Alexandr Andoni, Anupam Gupta, Robert Krauthgamer
2014	J	`jnl`	Vertex Sparsifiers: New Results from Old Techniques. SIAM J. Comput. Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2013	J	`jnl`	A Stochastic Probing Problem with Applications CoRR Anupam Gupta, Viswanath Nagarajan
2013	B	`conf`	A Stochastic Probing Problem with Applications. IPCO Anupam Gupta, Viswanath Nagarajan
2013	—	`conf`	Algorithms for Hub Label Optimization. ICALP (1) Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
2013	J	`jnl`	An Improved Integrality Gap for Asymmetric TSP Paths CoRR Zachary Friggstad, Anupam Gupta, Mohit Singh
2013	B	`conf`	An Improved Integrality Gap for Asymmetric TSP Paths. IPCO Zachary Friggstad, Anupam Gupta, Mohit Singh
2013	A	`conf`	Catch them if you can: how to serve impatient users. ITCS Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
2013	J	`jnl`	Clustering under approximation stability. J. ACM Maria-Florina Balcan, Avrim Blum, Anupam Gupta
2013	J	`jnl`	Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2013	A*	`conf`	Harnessing the power of two crossmatches. EC Avrim Blum, Anupam Gupta, Ariel D. Procaccia, Ankit Sharma
2013	J	`jnl`	Minimum d-dimensional arrangement with fixed points. CoRR Anupam Gupta, Anastasios Sidiropoulos
2013	J	`jnl`	Online Steiner Tree with Deletions. CoRR Anupam Gupta, Amit Kumar
2013	B	`conf`	Packing Interdiction and Partial Covering Problems. IPCO Michael Dinitz, Anupam Gupta
2013	J	`jnl`	Privately Releasing Conjunctions and the Statistical Query Barrier. SIAM J. Comput. Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman
2013	J	`jnl`	Random Rates for 0-Extension and Low-Diameter Decompositions. CoRR Anupam Gupta, Kunal Talwar
2013	J	`jnl`	Set Covering with Our Eyes Closed. SIAM J. Comput. Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2013	J	`jnl`	Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results CoRR Anupam Gupta, Kunal Talwar, David Witmer
2013	A*	`conf`	Sparsest cut on bounded treewidth graphs: algorithms and hardness results. STOC Anupam Gupta, Kunal Talwar, David Witmer
2013	—	`conf`	The Approximability of the Binary Paintshop Problem. APPROX-RANDOM Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber
2013	J	`jnl`	The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. CoRR Albert Gu, Anupam Gupta, Amit Kumar
2013	A*	`conf`	The power of deferral: maintaining a constant-competitive steiner tree online. STOC Albert Gu, Anupam Gupta, Amit Kumar
2013	J	`jnl`	Thrifty Algorithms for Multistage Robust Optimization CoRR Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
2013	B	`conf`	Thrifty Algorithms for Multistage Robust Optimization. IPCO Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
2013	J	`jnl`	Towards (1+ε)-Approximate Flow Sparsifiers. CoRR Alexandr Andoni, Anupam Gupta, Robert Krauthgamer
2012	J	`jnl`	Approximating Sparse Covering Integer Programs Online CoRR Anupam Gupta, Viswanath Nagarajan
2012	—	`conf`	Approximating Sparse Covering Integer Programs Online. ICALP (1) Anupam Gupta, Viswanath Nagarajan
2012	J	`jnl`	Approximating TSP on Metrics with Bounded Global Growth. SIAM J. Comput. T.-H. Hubert Chan, Anupam Gupta
2012	A*	`conf`	Approximation algorithms for stochastic orienteering. SODA Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2012	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings APPROX-RANDOM Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio
2012	B	`conf`	Iterative Constructions and Private Data Release. TCC Anupam Gupta, Aaron Roth, Jonathan R. Ullman
2012	—	`conf`	Multicast Routing for Energy Minimization Using Speed Scaling. MedAlg Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
2012	B	`conf`	Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling. WAOA Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2012	J	`jnl`	Online and Stochastic Survivable Network Design. SIAM J. Comput. Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2012	B	`conf`	Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan
2012	A*	`conf`	Scheduling heterogeneous processors isn't as easy as you think. SODA Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs
2012	J	`jnl`	Technical Note - Approximation Algorithms for VRP with Stochastic Demands. Oper. Res. Anupam Gupta, Viswanath Nagarajan, R. Ravi
2012	—	`conf`	The Online Metric Matching Problem for Doubling Metrics. ICALP (1) Anupam Gupta, Kevin Lewi
2012	J	`jnl`	When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra
2011	J	`jnl`	Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits CoRR Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011	A*	`conf`	Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011	J	`jnl`	Forest Density Estimation. J. Mach. Learn. Res. Han Liu, Min Xu, Haijie Gu, Anupam Gupta, John D. Lafferty, Larry A. Wasserman
2011	J	`jnl`	Iterative Constructions and Private Data Release CoRR Anupam Gupta, Aaron Roth, Jonathan R. Ullman
2011	J	`jnl`	Making Doubling Metrics Geodesic. Algorithmica Anupam Gupta, Kunal Talwar
2011	J	`jnl`	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs CoRR Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	B	`conf`	Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan
2011	J	`jnl`	Nonclairvoyantly scheduling power-heterogeneous processors. Sustain. Comput. Informatics Syst. Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2011	J	`jnl`	Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling CoRR Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2011	A*	`conf`	Privately releasing conjunctions and the statistical query barrier. STOC Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman
2011	J	`jnl`	Robust sensor placements at informative and communication-efficient locations. ACM Trans. Sens. Networks Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg
2011	J	`jnl`	Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2011	J	`jnl`	Scalably Scheduling Power-Heterogeneous Processors CoRR Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2011	J	`jnl`	Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2011	J	`jnl`	Simultaneous Optimization of Sensor Placements and Balanced Schedules. IEEE Trans. Autom. Control. Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin
2011	J	`jnl`	Welfare and Profit Maximization with Production Costs CoRR Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma
2011	A*	`conf`	Welfare and Profit Maximization with Production Costs. FOCS Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma
2010	—	`conf`	10211 Abstracts Collection - Flexible Network Design. Flexible Network Design Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
2010	A*	`conf`	A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy
2010	J	`jnl`	A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan
2010	J	`jnl`	An improved approximation algorithm for requirement cut. Oper. Res. Lett. Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010	J	`jnl`	Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems CoRR Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2010	—	`conf`	Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010	J	`jnl`	Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms CoRR Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar
2010	—	`conf`	Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar
2010	Misc	`conf`	Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis. COMSNETS Vyas Sekar, Anupam Gupta, Mike K. Reiter, Hui Zhang
2010	J	`jnl`	Dial a Ride from ACM Trans. Algorithms Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2010	A*	`conf`	Differentially Private Combinatorial Optimization. SODA Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar
2010	—	`ed.`	Flexible Network Design, 24.05. - 28.05.2010 Flexible Network Design Anupam Gupta, Stefano Leonardi, Berthold Vöcking, Roger Wattenhofer
2010	A*	`conf`	Forest Density Estimation. COLT Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu
2010	A	`conf`	Network-wide deployment of intrusion detection and prevention systems. CoNEXT Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter
2010	—	`conf`	Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2010	J	`jnl`	Privately Releasing Conjunctions and the Statistical Query Barrier CoRR Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan R. Ullman
2010	J	`jnl`	Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets CoRR Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010	—	`conf`	Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
2010	B	`conf`	Scheduling jobs with varying parallelizability to reduce variance. SPAA Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs
2010	—	`conf`	Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010	A*	`conf`	Tree Embeddings for Two-Edge-Connected Network Design. SODA Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2010	J	`jnl`	Ultra-low-dimensional embeddings for doubling metrics. J. ACM T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
2010	J	`jnl`	Vertex Sparsifiers: New Results from Old Techniques CoRR Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2010	—	`conf`	Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar
2010	—	`conf`	When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra
2010	J	`jnl`	When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings CoRR Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra
2009	A*	`conf`	A constant-factor approximation for stochastic Steiner forest. STOC Anupam Gupta, Amit Kumar
2009	A*	`conf`	Approximate clustering without the approximation. SODA Maria-Florina Balcan, Avrim Blum, Anupam Gupta
2009	J	`jnl`	Differentially Private Approximation Algorithms CoRR Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar
2009	—	`conf`	Differentially Private Combinatorial Optimization. Parameterized complexity and approximation algorithms Kunal Talwar, Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth
2009	J	`jnl`	Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins
2009	A*	`conf`	Online and stochastic survivable network design. STOC Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2009	J	`jnl`	Scheduling with Outliers CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2009	—	`conf`	Scheduling with Outliers. APPROX-RANDOM Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2009	A*	`conf`	Secretary problems: weights and discounts. SODA Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar
2009	—	`conf`	Simultaneous placement and scheduling of sensors. IPSN Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin
2009	J	`jnl`	Small Hop-diameter Sparse Spanners for Doubling Metrics. Discret. Comput. Geom. T.-H. Hubert Chan, Anupam Gupta
2009	J	`jnl`	Thresholded Covering Algorithms for Robust and Max-Min Optimization CoRR Anupam Gupta, Viswanath Nagarajan, R. Ravi
2008	A*	`conf`	A plant location guide for the unsure. SODA Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan
2008	—	`conf`	All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan
2008	A*	`conf`	Approximating TSP on metrics with bounded global growth. SODA T.-H. Hubert Chan, Anupam Gupta
2008	J	`jnl`	Cost-Sharing Mechanisms for Network Design. Algorithmica Anupam Gupta, Aravind Srinivasan, Éva Tardos
2008	J	`jnl`	Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Trans. Algorithms Shuchi Chawla, Anupam Gupta, Harald Räcke
2008	J	`jnl`	Extracting Dynamics from Static Cancer Expression Data. IEEE ACM Trans. Comput. Biol. Bioinform. Anupam Gupta, Ziv Bar-Joseph
2008	B	`conf`	How to Complete a Doubling Metric. LATIN Anupam Gupta, Kunal Talwar
2008	J	`jnl`	On the approximability of some network design problems. ACM Trans. Algorithms Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
2008	A*	`conf`	Set Covering with our Eyes Closed. FOCS Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2008	A*	`conf`	Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2008	J	`jnl`	Simpler Analyses of Local Search Algorithms for Facility Location CoRR Anupam Gupta, Kanat Tangwongsan
2008	A*	`conf`	Stochastic analyses for online combinatorial optimization problems. SODA Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski
2008	A*	`conf`	Ultra-low-dimensional embeddings for doubling metrics. SODA T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
2007	A	`conf`	An ESA Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2007	A*	`conf`	An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
2007	J	`jnl`	Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2007	J	`jnl`	Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2007	A	`conf`	Dial a Ride from ESA Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2007	J	`jnl`	Dial a Ride from k-forest CoRR Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2007	J	`jnl`	How to Complete a Doubling Metric CoRR Anupam Gupta, Kunal Talwar
2007	B	`conf`	Infrastructure Leasing Problems. IPCO Barbara M. Anthony, Anupam Gupta
2007	J	`jnl`	LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. Anupam Gupta, R. Ravi, Amitabh Sinha
2007	—	`conf`	On Configuring BGP Route Reflectors. COMSWARE Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi
2007	A	`conf`	Pricing Tree Access Networks with Connected Backbones. ESA Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
2007	—	`conf`	Selecting Observations against Adversarial Objectives. NIPS Andreas Krause, H. Brendan McMahan, Carlos Guestrin, Anupam Gupta
2007	—	`conf`	Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
2006	J	`jnl`	An Improved Approximation Ratio for the Covering Steiner Problem. Theory Comput. Anupam Gupta, Aravind Srinivasan
2006	A*	`conf`	Approximating unique games. SODA Anupam Gupta, Kunal Talwar
2006	J	`jnl`	Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. Kedar Dhamdhere, Anupam Gupta, R. Ravi
2006	J	`jnl`	Embedding SIAM J. Discret. Math. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
2006	A*	`conf`	Improved embeddings of graph metrics into random trees. SODA Kedar Dhamdhere, Anupam Gupta, Harald Räcke
2006	—	`conf`	Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg
2006	A*	`conf`	Oblivious network design. SODA Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke
2006	A*	`conf`	Quorum placement in networks: minimizing network congestion. PODC Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
2006	A*	`conf`	Small hop-diameter sparse spanners for doubling metrics. SODA T.-H. Hubert Chan, Anupam Gupta
2006	A	`conf`	Spanners with Slack. ESA T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta
2005	A*	`conf`	Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos
2005	J	`jnl`	Building Edge-Failure Resilient Networks. Algorithmica Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2005	A*	`conf`	Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA Shuchi Chawla, Anupam Gupta, Harald Räcke
2005	A*	`conf`	Metric Embeddings with Relaxed Guarantees. FOCS Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins
2005	J	`jnl`	On a bidirected relaxation for the MULTIWAY CUT problem. Discret. Appl. Math. Chandra Chekuri, Anupam Gupta, Amit Kumar
2005	A*	`conf`	On hierarchical routing in doubling metrics. SODA Hubert Tsz-Hong Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou
2005	A*	`conf`	On the approximability of some network design problems. SODA Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
2005	A*	`conf`	Quorum placement in networks to minimize access delays. PODC Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter
2005	A*	`conf`	Stochastic Steiner Trees Without a Root. ICALP Anupam Gupta, Martin Pál
2005	—	`conf`	What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2005	—	`conf`	Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM Anupam Gupta, Amit Kumar
2004	A*	`conf`	An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS Anupam Gupta, R. Ravi, Amitabh Sinha
2004	A	`conf`	Approximation Algorithms for Minimizing Average Distortion. STACS Kedar Dhamdhere, Anupam Gupta, R. Ravi
2004	A*	`conf`	Boosted sampling: approximation algorithms for stochastic optimization. STOC Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2004	—	`conf`	Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM Anupam Gupta, Aravind Srinivasan, Éva Tardos
2004	J	`jnl`	Cuts, Trees and l Comb. Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
2004	J	`jnl`	Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. Anupam Gupta, Amit Kumar, Rajeev Rastogi
2003	J	`jnl`	An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms Sanjoy Dasgupta, Anupam Gupta
2003	A*	`conf`	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2003	A*	`conf`	Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS Anupam Gupta, Robert Krauthgamer, James R. Lee
2003	A*	`conf`	Counting inversions in lists. SODA Anupam Gupta, Francis Zane
2003	A*	`conf`	Embedding k-outerplanar graphs into l1. SODA Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
2003	A*	`conf`	Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM Anupam Gupta, Amit Kumar, Rajeev Rastogi
2003	A*	`conf`	Improved results for directed multicut. SODA Anupam Gupta
2003	A*	`conf`	Lower bounds for embedding edit distance into normed spaces. SODA Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
2003	—	`conf`	On the Covering Steiner Problem. FSTTCS Anupam Gupta, Aravind Srinivasan
2003	A*	`conf`	Simpler and better approximation algorithms for network design. STOC Anupam Gupta, Amit Kumar, Tim Roughgarden
2003	B	`conf`	Tree based MPLS routing. SPAA Anupam Gupta, Amit Kumar, Mikkel Thorup
2002	A*	`conf`	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS Amit Kumar, Anupam Gupta, Tim Roughgarden
2002	—	`conf`	Approximation Algorithms for the Unsplittable Flow Problem. APPROX Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2002	B	`conf`	Building Edge-Failure Resilient Networks. IPCO Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2001	J	`jnl`	Improved Bandwidth Approximation for Trees and Chordal Graphs. J. Algorithms Anupam Gupta
2001	A*	`conf`	Provisioning a virtual private network: a network design problem for multicommodity flow. STOC Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener
2001	A*	`conf`	Sorting and Selection with Structured Costs. FOCS Anupam Gupta, Amit Kumar
2001	A*	`conf`	Steiner points in tree metrics don't (really) help. SODA Anupam Gupta
2001	A*	`conf`	Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS Anupam Gupta, Amit Kumar, Rajeev Rastogi
2000	A*	`conf`	A constant factor approximation algorithm for a class of classification problems. STOC Anupam Gupta, Éva Tardos
2000	J	`jnl`	Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. Discret. Comput. Geom. Anupam Gupta
2000	A*	`conf`	Improved bandwidth approximation for trees. SODA Anupam Gupta
1999	A*	`conf`	Cuts, Trees and l FOCS Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
1999	A*	`conf`	Embedding Tree Metrics Into Low Dimensional Euclidean Spaces. STOC Anupam Gupta