A new approach to the maximum flow problem AV Goldberg, RE Tarjan Journal of the ACM (JACM) 35 (4), 921-940, 1988 | 2792 | 1988 |

Shortest paths algorithms: Theory and experimental evaluation BV Cherkassky, AV Goldberg, T Radzik Mathematical programming 73 (2), 129-174, 1996 | 1097 | 1996 |

Computing the shortest path: A* search meets graph theory AV Goldberg, C Harrelson Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 | 935 | 2005 |

Quincy: fair scheduling for distributed computing clusters M Isard, V Prabhakaran, J Currey, U Wieder, K Talwar, A Goldberg Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles …, 2009 | 929 | 2009 |

Beyond the flow decomposition barrier AV Goldberg, S Rao Journal of the ACM (JACM) 45 (5), 783-797, 1998 | 543 | 1998 |

Beyond the flow decomposition barrier AV Goldberg, S Rao Journal of the ACM (JACM) 45 (5), 783-797, 1998 | 543 | 1998 |

Beyond the flow decomposition barrier AV Goldberg, S Rao Journal of the ACM (JACM) 45 (5), 783-797, 1998 | 543 | 1998 |

On implementing the push—relabel method for the maximum flow problem BV Cherkassky, AV Goldberg Algorithmica 19 (4), 390-410, 1997 | 526 | 1997 |

Route planning in transportation networks H Bast, D Delling, A Goldberg, M Müller-Hannemann, T Pajor, P Sanders, ... Algorithm engineering, 19-80, 2016 | 478 | 2016 |

An efficient implementation of a scaling minimum-cost flow algorithm AV Goldberg Journal of algorithms 22 (1), 1-29, 1997 | 451 | 1997 |

Finding minimum-cost circulations by canceling negative cycles AV Goldberg, RE Tarjan Journal of the ACM (JACM) 36 (4), 873-886, 1989 | 388 | 1989 |

Parallel symmetry-breaking in sparse graphs A Goldberg, S Plotkin, G Shannon Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987 | 374 | 1987 |

Competitive auctions for multiple digital goods AV Goldberg, JD Hartline European Symposium on Algorithms, 416-427, 2001 | 354 | 2001 |

Reach for A∗: Efficient point-to-point shortest path algorithms AV Goldberg, H Kaplan, RF Werneck Workshop on Algorithm Engineering & Experiments, 129-143, 2006 | 344 | 2006 |

Finding a maximum density subgraph AV Goldberg University of California, 1984 | 329 | 1984 |

Finding minimum-cost circulations by successive approximation AV Goldberg, RE Tarjan Mathematics of Operations Research 15 (3), 430-466, 1990 | 306 | 1990 |

Finding minimum-cost circulations by successive approximation AV Goldberg, RE Tarjan Mathematics of Operations Research 15 (3), 430-466, 1990 | 306 | 1990 |

On memory-bound functions for fighting spam C Dwork, A Goldberg, M Naor Annual International Cryptology Conference, 426-444, 2003 | 300 | 2003 |

Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic Behavior 55 (2), 242-269, 2006 | 298 | 2006 |

Solving minimum-cost flow problems by successive approximation A Goldberg, R Tarjan Proceedings of the nineteenth annual ACM symposium on Theory of computing, 7-18, 1987 | 296 | 1987 |