2026 Andrew V. Goldberg: 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	70	1842	1783	938	901	170	25158

Research.com Recognitions

2013 - SIAM Fellow For fundamental contributions in the design, analysis, and implementation of algorithms for network optimization problems.
2009 - ACM Fellow For contributions to fundamental theoretical and practical problems in the design and analysis of algorithms.

Overview

Andrew V. Goldberg is affiliated with Amazon in the United States. Their research primarily focuses on computer science with contributions across several specialized subfields and topics. The main fields of study include:

Computer Science

Within this domain, subfields of study that have been addressed in their work incorporate:

Computer Networks and Communications
Signal Processing
Computational Theory and Mathematics
Computer Graphics and Computer-Aided Design
Industrial and Manufacturing Engineering

Key topics in the research work include:

Optimization and Search Problems
Data Management and Algorithms
Computational Geometry and Mesh Generation
Vehicle Routing Optimization Methods
Complexity and Algorithms in Graphs
Graph Theory and Algorithms
Advanced Graph Theory Research

Andrew V. Goldberg has collaborated frequently with a set of coauthors, including:

Alexander Noe
Nikos Parotsidis
Maurício G. C. Resende
Quico Spaen
Yuanyuan Dong

Their recent publications reflect ongoing work in algorithm design, optimization, and network-related problems. Notable papers include:

Customizable Route Planning in Road Networks (2021), Proceedings of the International Symposium on Combinatorial Search
A metaheuristic algorithm for large maximum weight independent set problems (2024), Networks
A Local Search Algorithm for Large Maximum Weight Independent Set Problems (2022), Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application (2021), Operations Research Forum
A Local Search Algorithm for Large Maximum Weight Independent Set Problems (2022), arXiv (Cornell University)

Frequent publication venues where their research appears include:

arXiv (Cornell University)
Networks
Proceedings of the International Symposium on Combinatorial Search
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Operations Research Forum

Recognition for contributions to the field is indicated by awards such as:

SIAM Fellow (2013) for fundamental contributions in the design, analysis, and implementation of algorithms for network optimization problems
ACM Fellow (2009) for contributions to fundamental theoretical and practical problems in the design and analysis of algorithms

Best Publications

A new approach to the maximum-flow problem

Andrew V. Goldberg;Robert E. Tarjan

3721
Citations
Shortest paths algorithms: theory and experimental evaluation

Boris V. Cherkassky;Andrew V. Goldberg;Tomasz Radzik

1635
Citations
Quincy: fair scheduling for distributed computing clusters

Michael Isard;Vijayan Prabhakaran;Jon Currey;Udi Wieder

1197
Citations
Computing the shortest path: A search meets graph theory

Andrew V. Goldberg;Chris Harrelson

1181
Citations
Route Planning in Transportation Networks

Hannah Bast;Daniel Delling;Andrew V. Goldberg;Matthias Müller-Hannemann

809
Citations
Parallel symmetry-breaking in sparse graphs

Andrew V. Goldberg;Serge A. Plotkin;Gregory E. Shannon

720
Citations
Beyond the flow decomposition barrier

Andrew V. Goldberg;Satish Rao

671
Citations
On implementing the push-relabel method for the maximum flow problem

Boris V. Cherkassky;Andrew V. Goldberg

601
Citations
Finding minimum-cost circulations by canceling negative cycles

Andrew V. Goldberg;Robert E. Tarjan

552
Citations
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm

Andrew V Goldberg

547
Citations
Finding a Maximum Density Subgraph

A. V. Goldberg

480
Citations
Competitive auctions and digital goods

Andrew V. Goldberg;Jason D. Hartline;Andrew Wright

403
Citations
Reach for A : efficient point-to-point shortest path algorithms

Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck

402
Citations
Competitive Auctions for Multiple Digital Goods

Andrew V. Goldberg;Jason D. Hartline

386
Citations
Network decomposition and locality in distributed computation

B. Awerbuch;M. Luby;A.V. Goldberg;S.A. Plotkin

377
Citations
Finding Minimum-Cost Circulations by Successive Approximation

Andrew V. Goldberg;Robert E. Tarjan

365
Citations
A hub-based labeling algorithm for shortest paths in road networks

Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

349
Citations
On Memory-Bound Functions for Fighting Spam

Cynthia Dwork;Andrew V. Goldberg;Moni Naor

346
Citations
Solving minimum-cost flow problems by successive approximation

A. Goldberg;R. Tarjan

339
Citations
Improved approximation algorithms for network design problems

M. X. Goemans;A. V. Goldberg;S. Plotkin;D. B. Shmoys

316
Citations

Frequent Co-Authors

Renato F. Werneck Microsoft (United States)

Daniel Delling Apple (United States)

Robert E. Tarjan Princeton University

Serge Plotkin Stanford University

Jason D. Hartline Northwestern University

Ittai Abraham VMware

Haim Kaplan Tel Aviv University

Amos Fiat Tel Aviv University

Cynthia Dwork Harvard University

Robert L. Rounthwaite Microsoft (United States)

External Links

Wikipedia of Andrew V. Goldberg Personal website of Andrew V. Goldberg Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a wide array of related disciplines and flexible learning options. Many students look to combine their computer science knowledge with expertise in other fields through online degree programs.

For those interested in applying programming and data skills to sustainability and infrastructure, consider an online environmental engineering degree. This pathway integrates technical knowledge with environmental innovation.

If hands-on problem solving is your passion, you may want to pursue the cheapest online mechanical engineering degree. This option provides affordable and flexible education, ideal for future engineers who need to balance studies with other commitments.

Curious about the theoretical foundations of the universe? The answer to can you get a physics degree online reveals opportunities for in-depth physics education accessible from anywhere.

Finally, for those looking to specialize further, the demand for data professionals continues to grow rapidly. Explore the cheapest master in data science to gain advanced analytics skills for today's leading industries.