Andrew V. Goldberg
- Computer Networks and Communications top 0.2%
- Computational Theory and Mathematics top 0.1%
- Artificial Intelligence top 1%
- Signal Processing top 0.5%
- Computer Vision and Pattern Recognition top 1%
- Co-authors
- Robert E. TarjanBoris V. CherkasskyTomasz RadzikChris HarrelsonSerge PlotkinJason D. HartlineRenato F. WerneckSatish Rao
- Topics
- Complexity and Algorithms in Graphs (55 papers)Optimization and Search Problems (43 papers)Advanced Graph Theory Research (34 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesRussiaIsrael
In The Last Decade
Andrew V. Goldberg
107 papers receiving 6.8k citations
Hit Papers
Peers
Comparison fields: 5 of 142
- Computer Networks and Communications 3.3k
- Computational Theory and Mathematics 2.3k
- Artificial Intelligence 1.3k
- Signal Processing 1.1k
- Computer Vision and Pattern Recognition 1.0k
Countries citing papers authored by Andrew V. Goldberg
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 1 | |
| 3 | 3 | |
| 4 | 62 | |
| 5 | 64 | |
| 6 | 1 | |
| 7 | 61 | |
| 8 | Computing the shortest path: A search meets graph theorybreakdown → | 450 |
| 9 | 36 | |
| 10 | Truthful and Competitive Double Auctions | 1 |
| 11 | 162 | |
| 12 | Cut tree algorithms | 4 |
| 13 | 16 | |
| 14 | 2 | |
| 15 | 79 | |
| 16 | 99 | |
| 17 | 16 | |
| 18 | 99 | |
| 19 | 4 | |
| 20 | 2 |
About Andrew V. Goldberg
Andrew V. Goldberg is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications, having authored 110 papers that have together received 7.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (55 papers), Optimization and Search Problems (43 papers) and Advanced Graph Theory Research (34 papers). The work is most often cited by research in Computational Theory and Mathematics (2.3k citations), Computer Networks and Communications (3.3k citations) and Computer Graphics and Computer-Aided Design (443 citations). Andrew V. Goldberg has collaborated with scholars based in United States, Russia and Israel. Frequent 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. Their work appears in journals such as Communications of the ACM, Journal of the ACM and IEEE Transactions on Computers.
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.