Andrew V. Goldberg

15.2k total citations · 3 hit papers
110 papers, 7.3k citations indexed

About

Andrew V. Goldberg is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Signal Processing. According to data from OpenAlex, Andrew V. Goldberg has authored 110 papers receiving a total of 7.3k indexed citations (citations by other indexed papers that have themselves been cited), including 63 papers in Computational Theory and Mathematics, 60 papers in Computer Networks and Communications and 20 papers in Signal Processing. Recurrent topics in Andrew V. Goldberg's work include Complexity and Algorithms in Graphs (55 papers), Optimization and Search Problems (43 papers) and Advanced Graph Theory Research (34 papers). Andrew V. Goldberg is often cited by papers focused on Complexity and Algorithms in Graphs (55 papers), Optimization and Search Problems (43 papers) and Advanced Graph Theory Research (34 papers). Andrew V. Goldberg collaborates with scholars based in United States, Russia and Israel. Andrew V. Goldberg's co-authors include Robert E. Tarjan, Boris V. Cherkassky, Tomasz Radzik, Chris Harrelson, Serge Plotkin, Jason D. Hartline, Renato F. Werneck, Satish Rao, Daniel Delling and Kunal Talwar and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and IEEE Transactions on Computers.

In The Last Decade

Andrew V. Goldberg

107 papers receiving 6.8k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

A new approach to the maximum-flow problem

1988 1.2k citations Andrew V. Goldberg et al. profile →
Quincy

2009 595 citations Andrew V. Goldberg et al. profile →
Computing the shortest path: A search meets graph theory

2005 450 citations Andrew V. Goldberg, Chris Harrelson Symposium on Discrete Algorithms profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Andrew V. Goldberg United States	38	3.3k	2.3k	1.3k	1.1k	1.0k	110	7.3k
Nimrod Megiddo United States	43	2.6k 0.8×	2.7k 1.2×	1.7k 1.4×	1.0k 0.9×	955 0.9×	150	8.5k
Richard R. Muntz United States	38	3.5k 1.1×	921 0.4×	1.4k 1.1×	1.2k 1.0×	574 0.6×	157	6.6k
Christos H. Papadimitriou United States	60	5.6k 1.7×	3.7k 1.6×	3.6k 2.9×	1.3k 1.2×	1.2k 1.2×	202	12.5k
Sudipto Guha United States	38	2.7k 0.8×	1.2k 0.5×	3.7k 3.0×	2.3k 2.0×	1.2k 1.2×	114	7.3k
Clifford Stein United States	30	2.8k 0.9×	1.2k 0.5×	1.2k 0.9×	434 0.4×	592 0.6×	105	5.4k
James B. Orlin United States	45	3.9k 1.2×	3.0k 1.3×	1.5k 1.2×	618 0.5×	836 0.8×	156	12.4k
Dorit S. Hochbaum United States	40	2.3k 0.7×	1.8k 0.8×	823 0.7×	399 0.4×	694 0.7×	163	6.2k
Moses Charikar United States	42	3.1k 0.9×	2.0k 0.8×	3.7k 2.9×	1.9k 1.7×	2.6k 2.5×	136	9.3k
Ravindra K. Ahuja United States	37	2.9k 0.9×	1.9k 0.8×	996 0.8×	511 0.4×	670 0.7×	97	10.0k
Subhash Suri United States	47	4.9k 1.5×	665 0.3×	1.8k 1.4×	1.1k 0.9×	1.3k 1.3×	228	8.4k

Countries citing papers authored by Andrew V. Goldberg

Since Specialization

Citations

This map shows the geographic impact of Andrew V. Goldberg's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrew V. Goldberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew V. Goldberg more than expected).

Fields of papers citing papers by Andrew V. Goldberg

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrew V. Goldberg. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrew V. Goldberg. The network helps show where Andrew V. Goldberg may publish in the future.

Co-authorship network of co-authors of Andrew V. Goldberg

This figure shows the co-authorship network connecting the top 25 collaborators of Andrew V. Goldberg. A scholar is included among the top collaborators of Andrew V. Goldberg based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrew V. Goldberg. Andrew V. Goldberg is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Goldberg, Andrew V., et al.. (2024). A metaheuristic algorithm for large maximum weight independent set problems. Networks. 85(1). 91–112. 2 indexed citations

Goldberg, Andrew V., et al.. (2022). A Local Search Algorithm for Large Maximum Weight Independent Set Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Goldberg, Andrew V., et al.. (2016). Algorithms for Hub Label Optimization. ACM Transactions on Algorithms. 13(1). 1–17. 3 indexed citations

Goldberg, Andrew V. & Alexander S. Kulikov. (2016). Experimental Algorithms. Lecture notes in computer science. 8 indexed citations

Goldberg, Andrew V. & Y. Zhou. (2009). Algorithmic aspects in information and management : 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009 : proceedings. Springer eBooks. 1 indexed citations

Demetrescu, Camil, Andrew V. Goldberg, & David S. Johnson. (2009). The Shortest Path Problem. 64 indexed citations

Goldberg, Andrew V. & Jason D. Hartline. (2005). Collusion-resistant mechanisms for single-parameter agents. Symposium on Discrete Algorithms. 620–629. 61 indexed citations

Goldberg, Andrew V. & Chris Harrelson. (2005). Computing the shortest path: A search meets graph theory. Symposium on Discrete Algorithms. 156–165. 450 indexed citations breakdown →

Goldberg, Andrew V. & Alexander V. Karzanov. (2004). Maximum skew-symmetric flows and matchings. Mathematical Programming. 100(3). 30 indexed citations

10.

Goldberg, Andrew V. & Jason D. Hartline. (2003). Competitiveness via consensus. Symposium on Discrete Algorithms. 215–222. 36 indexed citations

11.

Deshmukh, Kaustubh, Andrew V. Goldberg, Jason D. Hartline, & Anna R. Karlin. (2002). Truthful and Competitive Double Auctions. Lecture notes in computer science. 361–373. 1 indexed citations

12.

Goldberg, Andrew V., et al.. (2001). Competitive auctions and digital goods. Symposium on Discrete Algorithms. 735–744. 162 indexed citations

13.

Goldberg, Andrew V. & Kostas Tsioutsiouliklis. (1999). Cut tree algorithms. Symposium on Discrete Algorithms. 376–385. 4 indexed citations

14.

Cherkassky, Boris V., Andrew V. Goldberg, & Craig Silverstein. (1997). Buckets, heaps, lists, and monotone priority queues. Symposium on Discrete Algorithms. 83–92. 16 indexed citations

15.

Downie, Peter, Andrew V. Goldberg, Gupta Rk, et al.. (1997). Growth inhibition of B-cell precursor acute lymphoblastic leukemia cell lines by monocytes: A role for prostaglandin E2. Leukemia Research. 21(10). 925–932. 2 indexed citations

16.

Goemans, M. X., Andrew V. Goldberg, Serge Plotkin, et al.. (1994). Improved approximation algorithms for network design problems. Symposium on Discrete Algorithms. 223–232. 99 indexed citations

17.

Cherkassky, Boris V., Andrew V. Goldberg, & Tomasz Radzik. (1994). Shortest paths algorithms: theory and experimental evaluation. Symposium on Discrete Algorithms. 516–525. 79 indexed citations

18.

Goldberg, Andrew V.. (1993). Scaling algorithms for the shortest paths problem. Symposium on Discrete Algorithms. 222–231. 16 indexed citations

19.

Radzik, Tomasz & Andrew V. Goldberg. (1991). Tight bounds on the number of minimum-mean cycle cancellations and related results. Symposium on Discrete Algorithms. 110–119. 4 indexed citations

20.

Goldberg, Andrew V. & Karl Lieberherr. (1985). Efficient Test Generation Algorithms.. International Test Conference. 46(5). 508–517. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact