Andrew V. Goldberg
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
65
Venues
18
Active years
1984–2022
Best venue rank
A*
Where they publish
Papers
65 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | ESA | A Local Search Algorithm for Large Maximum Weight Independent Set Problems. | Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen |
| 2016 | SODA | On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. | Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck |
| 2015 | ESA | Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck |
| 2015 | MFCS | On the Complexity of Hub Labeling (Extended Abstract). | Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller |
| 2015 | STACS | Minimum Cost Flows in Graphs with Unit Capacities. | Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan |
| 2014 | ESA | Robust Distance Queries on Massive Networks. | Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck |
| 2013 | ICALP | Algorithms for Hub Label Optimization. | Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan |
| 2013 | MFCS | Separating Hierarchical and General Hub Labelings. | Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko |
| 2013 | SoCS | Customizable Route Planning in Road Networks (Extended Abstract). | Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck |
| 2012 | ALENEX | Exact Combinatorial Branch-and-Bound for Graph Bisection. | Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck |
| 2012 | ESA | Hierarchical Hub Labelings for Shortest Paths. | Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2011 | ATMOS | Faster Batched Shortest Paths in Road Networks. | Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2011 | ESA | Maximum Flows by Incremental Breadth-First Search. | Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2011 | ICALP | VC-Dimension and Shortest Path Algorithms. | Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2010 | SODA | Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. | Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2009 | AAIM | Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. | Andrew V. Goldberg |
| 2009 | ALENEX | An Experimental Study of Minimum Mean Cycle Algorithms. | Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2009 | SOSP | Quincy: fair scheduling for distributed computing clusters. | Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg |
| 2008 | ALENEX | Shortest Path Feasibility Algorithms: An Experimental Evaluation. | Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
| 2008 | ESA | The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. | Andrew V. Goldberg |
| 2007 | SOFSEM | Point-to-Point Shortest Path Algorithms with Preprocessing. | Andrew V. Goldberg |
| 2006 | ALENEX | Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. | Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck |
| 2006 | ICDCS | Routing in Networks with Low Doubling Dimension. | Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi |
| 2005 | ALENEX | Computing Point-to-Point Shortest Paths from External Memory. | Andrew V. Goldberg, Renato Fonseca F. Werneck |
| 2005 | SODA | Computing the shortest path: | Andrew V. Goldberg, Chris Harrelson |
| 2005 | SODA | Collusion-resistant mechanisms for single-parameter agents. | Andrew V. Goldberg, Jason D. Hartline |
| 2005 | STOC | Derandomization of auctions. | Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan |
| 2004 | STACS | A Lower Bound on the Competitive Ratio of Truthful Auctions. | Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks |
| 2003 | CRYPTO | On Memory-Bound Functions for Fighting Spam. | Cynthia Dwork, Andrew V. Goldberg, Moni Naor |
| 2003 | SODA | Competitiveness via consensus. | Andrew V. Goldberg, Jason D. Hartline |
| 2002 | ESA | Truthful and Competitive Double Auctions. | Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin |
| 2002 | STOC | Competitive generalized auctions. | Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin |
| 2001 | ESA | A Simple Shortest Path Algorithm with Linear Average Time. | Andrew V. Goldberg |
| 2001 | ESA | Competitive Auctions for Multiple Digital Goods. | Andrew V. Goldberg, Jason D. Hartline |
| 2001 | ISAAC | Shortest Path Algorithms: Engineering Aspects. | Andrew V. Goldberg |
| 2001 | SODA | Competitive auctions and digital goods. | Andrew V. Goldberg, Jason D. Hartline, Andrew Wright |
| 1999 | SODA | Cut Tree Algorithms. | Andrew V. Goldberg, Kostas Tsioutsiouliklis |
| 1999 | SODA | Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. | Andrew V. Goldberg, Bernard M. E. Moret |
| 1998 | IPCO | An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein |
| 1997 | FOCS | Beyond the Flow Decomposition Barrier. | Andrew V. Goldberg, Satish Rao |
| 1997 | FOCS | Flows in Undirected Unit Capacity Networks. | Andrew V. Goldberg, Satish Rao |
| 1997 | SODA | Experimental Study of Minimum Cut Algorithms. | Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein |
| 1997 | SODA | Buckets, Heaps, Lists, and Monotone Priority Queues. | Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein |
| 1996 | ESA | Negative-Cycle Detection Algorithms. | Boris V. Cherkassky, Andrew V. Goldberg |
| 1995 | ESA | Maximum Skew-Symmetric Flows. | Andrew V. Goldberg, Alexander V. Karzanov |
| 1995 | IPCO | On Implementing Push-Relabel Method for the Maximum Flow Problem. | Boris V. Cherkassky, Andrew V. Goldberg |
| 1994 | ESA | Optimization Algorithms For Large Networks. | Andrew V. Goldberg |
| 1994 | SODA | Shortest Paths Algorithms: Theory and Experimental Evaluation. | Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik |
| 1994 | SODA | Improved Approximation Algorithms for Network Design Problems. | Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos, David P. Williamson |
| 1994 | SODA | Path Problems in Skew-Symmetric Graphs. | Andrew V. Goldberg, Alexander V. Karzanov |
| 1993 | IPCO | An efficient implementation of a scaling minimum-cost flow algorithm. | Andrew V. Goldberg |
| 1993 | SODA | Scaling Algorithms for the Shortest Paths Problem. | Andrew V. Goldberg |
| 1991 | SODA | Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. | Tomasz Radzik, Andrew V. Goldberg |
| 1989 | FOCS | Network Decomposition and Locality in Distributed Computation | Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin |
| 1989 | FOCS | Interior-Point Methods in Parallel Computation | Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, va Tardos |
| 1989 | FOCS | Lower Bounds for Pseudorandom Number Generators | Michael Kharitonov, Andrew V. Goldberg, Moti Yung |
| 1988 | FOCS | Combinatorial Algorithms for the Generalized Circulation Problem | Andrew V. Goldberg, Serge A. Plotkin, va Tardos |
| 1988 | FOCS | Sublinear-Time Parallel Algorithms for Matching and Related Problems | Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya |
| 1988 | STOC | Finding Minimum-Cost Circulations by Canceling Negative Cycles | Andrew V. Goldberg, Robert Endre Tarjan |
| 1987 | STOC | Parallel Symmetry-Breaking in Sparse Graphs | Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon |
| 1987 | STOC | Solving Minimum-Cost Flow Problems by Successive Approximation | Andrew V. Goldberg, Robert Endre Tarjan |
| 1986 | STOC | A New Approach to the Maximum Flow Problem | Andrew V. Goldberg, Robert Endre Tarjan |
| 1985 | ITC | Efficient Test Generation Algorithms. | Andrew V. Goldberg, Karl J. Lieberherr |
| 1985 | STOC | Compression and Ranking | Andrew V. Goldberg, Michael Sipser |
| 1984 | STOC | On Finding the Exact Solution of a Zero-One Knapsack Problem | Andrew V. Goldberg, Alberto Marchetti-Spaccamela |