2026 Anupam Gupta: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	63	2800	2717	1382	1331	268	12906

Overview

Anupam Gupta is affiliated with Carnegie Mellon University in the United States. Their primary research area is Computer Science, with 113 publications contributing to this field.

Gupta's work spans several subfields, including:

Computer Networks and Communications
Computational Theory and Mathematics
Artificial Intelligence
Industrial and Manufacturing Engineering
Management Science and Operations Research

The scientist's research covers multiple main topics, such as:

Optimization and Search Problems
Complexity and Algorithms in Graphs
Scheduling and Optimization Algorithms
Auction Theory and Applications
Facility Location and Emergency Management
Optimization and Packing Problems
Advanced Bandit Algorithms Research

Anupam Gupta has published in a variety of journals and venues, with the most frequent being:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Mathematical Programming
SIAM Journal on Computing
Indian Journal of Physical Medicine and Rehabilitation

They have co-authored several papers with the following collaborators:

Amit Kumar
Euiwoong Lee
Jason Li
Sahil Singla
Viswanath Nagarajan

Among the notable recent papers authored or co-authored by Anupam Gupta are:

"Fair algorithms for selecting citizens' assemblies", 2021, published in Nature
"Exact Exponential Algorithms for Clustering Problems", 2022, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Robust Algorithms for the Secretary Problem", 2020, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Chasing Convex Bodies with Linear Competitive Ratio", 2021, published in Journal of the ACM
"Stochastic Load Balancing on Unrelated Machines", 2020, published in Mathematics of Operations Research

Anupam Gupta has contributed to book publications, including one with Springer Science+Business Media titled "Integer Programming and Combinatorial Optimization" published in 2022.

Best Publications

An elementary proof of a theorem of Johnson and Lindenstrauss

Sanjoy Dasgupta;Anupam Gupta

1230
Citations
Near-optimal sensor placements: maximizing information while minimizing communication cost

Andreas Krause;Carlos Guestrin;Anupam Gupta;Jon Kleinberg

578
Citations
Bounded geometries, fractals, and low-distortion embeddings

A. Gupta;R. Krauthgamer;J.R. Lee

497
Citations
Provisioning a virtual private network: a network design problem for multicommodity flow

Anupam Gupta;Jon Kleinberg;Amit Kumar;Rajeev Rastogi

392
Citations
Robust Submodular Observation Selection

Andreas Krause;H. Brendan McMahan;Carlos Guestrin;Anupam Gupta

331
Citations
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

Nikhil Bansal;Anupam Gupta;Jian Li;Julián Mestre

303
Citations
Privately Releasing Conjunctions and the Statistical Query Barrier

Anupam Gupta;Moritz Hardt;Aaron Roth;Jonathan R. Ullman

287
Citations
Cuts, Trees and ℓ 1 -Embeddings of Graphs*

Anupam Gupta;Alistair Sinclair;Ilan Newman;Yuri Rabinovich

263
Citations
Simpler and better approximation algorithms for network design

Anupam Gupta;Amit Kumar;Tim Roughgarden

219
Citations
Constrained non-monotone submodular maximization: offline and secretary algorithms

Anupam Gupta;Aaron Roth;Grant Schoenebeck;Kunal Talwar

214
Citations
Boosted sampling: approximation algorithms for stochastic optimization

Anupam Gupta;Martin Pál;R. Ravi;Amitabh Sinha

209
Citations
Approximation Algorithms for the Unsplittable Flow Problem

Amit Chakrabarti;Chandra Chekuri;Anupam Gupta;Amit Kumar

199
Citations
Iterative constructions and private data release

Anupam Gupta;Aaron Roth;Jonathan Ullman

197
Citations
Differentially private combinatorial optimization

Anupam Gupta;Katrina Ligett;Frank McSherry;Aaron Roth

177
Citations
On Hierarchical Routing in Doubling Metrics

T.-H. Hubert Chan;Anupam Gupta;Bruce M. Maggs;Shuheng Zhou

174
Citations
Approximate clustering without the approximation

Maria-Florina Balcan;Avrim Blum;Anupam Gupta

169
Citations
Cuts, trees and l/sub 1/-embeddings of graphs

A. Gupta;I. Newman;Y. Rabinovich;A. Sinclair

159
Citations
Vertex Sparsifiers: New Results from Old Techniques

Matthias Englert;Anupam Gupta;Robert Krauthgamer;Harald Räcke

136
Citations
Discovering pathways by orienting edges in protein interaction networks

Anthony Gitter;Judith Klein-Seetharaman;Anupam Gupta;Ziv Bar-Joseph

131
Citations
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

Shuchi Chawla;Anupam Gupta;Harald Räcke

124
Citations
Better Algorithms for Stochastic Bandits with Adversarial Corruptions

Anupam Gupta;Tomer Koren;Kunal Talwar

76
Citations

Frequent Co-Authors

R. Ravi Carnegie Mellon University

Kunal Talwar Apple (United States)

Nikhil Bansal University of Michigan–Ann Arbor

Joseph (Seffi) Naor Technion – Israel Institute of Technology

Aaron Roth University of Pennsylvania

Chandra Chekuri University of Illinois at Urbana-Champaign

Kirk Pruhs University of Pittsburgh

Niv Buchbinder Tel Aviv University

Carlos Guestrin Stanford University

Robert Krauthgamer Weizmann Institute of Science

External Links

Personal website of Anupam Gupta Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

As the demand for tech professionals grows, there are more flexible ways to advance your education in Computer Science. Many students consider fastest online master's degree programs so they can quickly gain advanced skills and compete for top positions.

Understanding which master's degree is most in demand in usa can help guide your choice of specialization. Data science, cybersecurity, and software engineering master's programs are especially valued by employers.

For those just starting out, an associates degree online offers a flexible and cost-effective entry point into the tech field. These programs often provide foundational skills needed for entry-level roles or further study.

Affordability is also an important factor. Many students look for cheap online degrees fast options that fit their budget and timeline without sacrificing quality.

By exploring these online pathways, you can tailor your education to your goals and quickly set yourself up for success in the ever-evolving tech industry.