Andrew V. Goldberg

150 papers A* 33A 22B 13C 3Journal 55Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A metaheuristic algorithm for large maximum weight independent set problems. Networks Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	A	`conf`	A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	J	`jnl`	A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	New instances for maximum weight independent set from a vehicle routing application. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2017	J	`jnl`	Customizable Route Planning in Road Networks. Transp. Sci. Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2017	J	`jnl`	Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan
2016	J	`jnl`	Algorithms for Hub Label Optimization. ACM Trans. Algorithms Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
2016	B	`ed.`	Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings SEA Andrew V. Goldberg, Alexander S. Kulikov
2016	J	`jnl`	Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck
2016	—	`ch.`	Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016	—	`ch.`	Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms Camil Demetrescu, Andrew V. Goldberg, David S. Johnson
2016	A*	`conf`	On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2016	—	`ch.`	Route Planning in Transportation Networks. Algorithm Engineering Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015	J	`jnl`	An exact combinatorial algorithm for minimum graph bisection. Math. Program. Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2015	A	`conf`	Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck
2015	A	`conf`	Minimum Cost Flows in Graphs with Unit Capacities. STACS Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan
2015	—	`conf`	Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS Daniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck
2015	—	`conf`	On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
2015	J	`jnl`	On the Complexity of Hub Labeling. CoRR Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller
2015	J	`jnl`	Route Planning in Transportation Networks. CoRR Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2014	J	`jnl`	Efficient maximum flow algorithms. Commun. ACM Andrew V. Goldberg, Robert Endre Tarjan
2014	B	`conf`	Hub Labels: Theory and Practice. SEA Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck
2014	A	`conf`	Robust Distance Queries on Massive Networks. ESA Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2013	J	`jnl`	Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner
2013	—	`conf`	Algorithms for Hub Label Optimization. ICALP (1) Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan
2013	J	`jnl`	Alternative routes in road networks. ACM J. Exp. Algorithmics Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013	B	`conf`	Customizable Route Planning in Road Networks (Extended Abstract). SOCS Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
2013	B	`conf`	Hub Label Compression. SEA Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2013	J	`jnl`	PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck
2013	—	`conf`	Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN Edith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck
2013	J	`jnl`	Separating Hierarchical and General Hub Labelings CoRR Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
2013	B	`conf`	Separating Hierarchical and General Hub Labelings. MFCS Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
2013	B	`conf`	The Hub Labeling Algorithm. SEA Andrew V. Goldberg
2012	A	`conf`	Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2012	—	`conf`	HLDB: location-based services in databases. SIGSPATIAL/GIS Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2012	A	`conf`	Hierarchical Hub Labelings for Shortest Paths. ESA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	B	`conf`	A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	B	`conf`	Customizable Route Planning. SEA Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck
2011	J	`jnl`	Derandomization of auctions. Games Econ. Behav. Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
2011	C	`conf`	Faster Batched Shortest Paths in Road Networks. ATMOS Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	A	`conf`	Graph Partitioning with Natural Cuts. IPDPS Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2011	A	`conf`	Maximum Flows by Incremental Breadth-First Search. ESA Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck
2011	A	`conf`	PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck
2011	J	`jnl`	Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2011	—	`conf`	VC-Dimension and Shortest Path Algorithms. ICALP (1) Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	B	`conf`	Alternative Routes in Road Networks. SEA Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010	A*	`conf`	Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2009	C	`ed.`	Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings AAIM Andrew V. Goldberg, Yunhong Zhou
2009	A	`conf`	An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	A*	`conf`	Quincy: fair scheduling for distributed computing clusters. SOSP Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg
2009	J	`jnl`	Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2009	—	`ed.`	The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006 The Shortest Path Problem Camil Demetrescu, Andrew V. Goldberg, David S. Johnson
2009	C	`conf`	Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. AAIM Andrew V. Goldberg
2008	J	`jnl`	A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comput. Andrew V. Goldberg
2008	—	`ch.`	Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms Camil Demetrescu, Andrew V. Goldberg, David S. Johnson
2008	A	`conf`	Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2008	A	`conf`	The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. ESA Andrew V. Goldberg
2007	—	`conf`	Better Landmarks Within Reach. WEA Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
2007	—	`conf`	Experimental Evaluation of Parametric Max-Flow Algorithms. WEA Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou
2007	—	`conf`	Point-to-Point Shortest Path Algorithms with Preprocessing. SOFSEM (1) Andrew V. Goldberg
2006	J	`jnl`	Competitive auctions. Games Econ. Behav. Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright
2006	A	`conf`	Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006	—	`conf`	Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006	A	`conf`	Routing in Networks with Low Doubling Dimension. ICDCS Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi
2005	A*	`conf`	Collusion-resistant mechanisms for single-parameter agents. SODA Andrew V. Goldberg, Jason D. Hartline
2005	—	`conf`	Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO Andrew V. Goldberg, Renato Fonseca F. Werneck
2005	A*	`conf`	Computing the shortest path: SODA Andrew V. Goldberg, Chris Harrelson
2005	A*	`conf`	Derandomization of auctions. STOC Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan
2004	A	`conf`	A Lower Bound on the Competitive Ratio of Truthful Auctions. STACS Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks
2004	J	`jnl`	Maximum skew-symmetric flows and matchings. Math. Program. Andrew V. Goldberg, Alexander V. Karzanov
2003	A*	`conf`	Competitiveness via consensus. SODA Andrew V. Goldberg, Jason D. Hartline
2003	A*	`conf`	Envy-free auctions for digital goods. EC Andrew V. Goldberg, Jason D. Hartline
2003	A*	`conf`	On Memory-Bound Functions for Fighting Spam. CRYPTO Cynthia Dwork, Andrew V. Goldberg, Moni Naor
2002	A*	`conf`	Competitive generalized auctions. STOC Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
2002	A	`conf`	Truthful and Competitive Double Auctions. ESA Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin
2001	A	`conf`	A Simple Shortest Path Algorithm with Linear Average Time. ESA Andrew V. Goldberg
2001	A	`conf`	Competitive Auctions for Multiple Digital Goods. ESA Andrew V. Goldberg, Jason D. Hartline
2001	A*	`conf`	Competitive auctions and digital goods. SODA Andrew V. Goldberg, Jason D. Hartline, Andrew Wright
2001	J	`jnl`	Cut Tree Algorithms: An Experimental Study. J. Algorithms Andrew V. Goldberg, Kostas Tsioutsiouliklis
2001	B	`conf`	Shortest Path Algorithms: Engineering Aspects. ISAAC Andrew V. Goldberg
1999	—	`conf`	A Prototype Implementation of Archival Intermemory. ACM DL Yuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, Peter N. Yianilos
1999	J	`jnl`	Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
1999	A*	`conf`	Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA Andrew V. Goldberg, Bernard M. E. Moret
1999	—	`conf`	Computational evaluation of hot queues. Data Structures, Near Neighbor Searches, and Methodology Andrew V. Goldberg, Craig Silverstein
1999	A*	`conf`	Cut Tree Algorithms. SODA Andrew V. Goldberg, Kostas Tsioutsiouliklis
1999	J	`jnl`	Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. Andrew V. Goldberg, Satish Rao
1999	J	`jnl`	Negative-cycle detection algorithms. Math. Program. Boris V. Cherkassky, Andrew V. Goldberg
1999	—	`conf`	Selecting Problems for Algorithm Evaluation. WAE Andrew V. Goldberg
1998	B	`conf`	An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein
1998	J	`jnl`	Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. ACM J. Exp. Algorithmics Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
1998	J	`jnl`	Beyond the Flow Decomposition Barrier. J. ACM Andrew V. Goldberg, Satish Rao
1998	—	`conf`	Recent Developments in Maximum Flow Algorithms (Invited Lecture). SWAT Andrew V. Goldberg
1998	—	`conf`	Towards an Archival Intermemory. ADL Andrew V. Goldberg, Peter N. Yianilos
1997	J	`jnl`	An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms Andrew V. Goldberg
1997	—	`conf`	Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. WAE Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi
1997	A*	`conf`	Beyond the Flow Decomposition Barrier. FOCS Andrew V. Goldberg, Satish Rao
1997	A*	`conf`	Buckets, Heaps, Lists, and Monotone Priority Queues. SODA Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
1997	A*	`conf`	Experimental Study of Minimum Cut Algorithms. SODA Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein
1997	A*	`conf`	Flows in Undirected Unit Capacity Networks. FOCS Andrew V. Goldberg, Satish Rao
1997	J	`jnl`	Global Price Updates Help. SIAM J. Discret. Math. Andrew V. Goldberg, Robert Kennedy
1997	J	`jnl`	On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica Boris V. Cherkassky, Andrew V. Goldberg
1997	J	`jnl`	Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. Andrew V. Goldberg, Alexander V. Karzanov
1997	J	`jnl`	Strategic directions in research in theory of computing. SIGACT News Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
1996	A	`conf`	Negative-Cycle Detection Algorithms. ESA Boris V. Cherkassky, Andrew V. Goldberg
1996	J	`jnl`	Path Problems in Skew-Symmetric Graphs. Comb. Andrew V. Goldberg, Alexander V. Karzanov
1996	J	`jnl`	Shortest paths algorithms: Theory and experimental evaluation. Math. Program. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
1995	J	`jnl`	An efficient cost scaling algorithm for the assignment problem. Math. Program. Andrew V. Goldberg, Robert Kennedy
1995	A	`conf`	Maximum Skew-Symmetric Flows. ESA Andrew V. Goldberg, Alexander V. Karzanov
1995	B	`conf`	On Implementing Push-Relabel Method for the Maximum Flow Problem. IPCO Boris V. Cherkassky, Andrew V. Goldberg
1995	J	`jnl`	Scaling Algorithms for the Shortest Paths Problem. SIAM J. Comput. Andrew V. Goldberg
1994	J	`jnl`	A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Trans. Computers Andrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin
1994	A*	`conf`	Improved Approximation Algorithms for Network Design Problems. SODA Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
1994	A	`conf`	Optimization Algorithms For Large Networks. ESA Andrew V. Goldberg
1994	A*	`conf`	Path Problems in Skew-Symmetric Graphs. SODA Andrew V. Goldberg, Alexander V. Karzanov
1994	A*	`conf`	Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
1994	J	`jnl`	Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica Tomasz Radzik, Andrew V. Goldberg
1993	B	`conf`	An efficient implementation of a scaling minimum-cost flow algorithm. IPCO Andrew V. Goldberg
1993	J	`jnl`	Approximating Matchings in Parallel. Inf. Process. Lett. Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin
1993	A*	`conf`	Scaling Algorithms for the Shortest Paths Problem. SODA Andrew V. Goldberg
1993	J	`jnl`	Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
1992	J	`jnl`	A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. Inf. Process. Lett. Andrew V. Goldberg
1992	J	`jnl`	Finding minimum-cost flows by double scaling. Math. Program. Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
1992	J	`jnl`	Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1991	J	`jnl`	Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1991	J	`jnl`	Compression and Ranking. SIAM J. Comput. Andrew V. Goldberg, Michael Sipser
1991	—	`conf`	Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine. Network Flows And Matching Farid Alizadeth, Andrew V. Goldberg
1991	—	`conf`	On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching Andrew V. Goldberg, Michael Kharitonov
1991	J	`jnl`	Processor-Efficient Implementation of a Maximum Flow Algorithm. Inf. Process. Lett. Andrew V. Goldberg
1991	A*	`conf`	Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA Tomasz Radzik, Andrew V. Goldberg
1991	J	`jnl`	Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. Andrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan
1991	J	`jnl`	Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov). SIAM Rev. Andrew V. Goldberg, Dan Gusfield
1990	J	`jnl`	Finding Minimum-Cost Circulations by Successive Approximation. Math. Oper. Res. Andrew V. Goldberg, Robert E. Tarjan
1989	J	`jnl`	A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. Inf. Process. Lett. Andrew V. Goldberg, Robert Endre Tarjan
1989	J	`jnl`	Finding minimum-cost circulations by canceling negative cycles. J. ACM Andrew V. Goldberg, Robert Endre Tarjan
1989	A*	`conf`	Interior-Point Methods in Parallel Computation FOCS Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1989	A*	`conf`	Lower Bounds for Pseudorandom Number Generators FOCS Michael Kharitonov, Andrew V. Goldberg, Moti Yung
1989	A*	`conf`	Network Decomposition and Locality in Distributed Computation FOCS Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin
1988	J	`jnl`	A new approach to the maximum-flow problem. J. ACM Andrew V. Goldberg, Robert Endre Tarjan
1988	A*	`conf`	Combinatorial Algorithms for the Generalized Circulation Problem FOCS Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
1988	A*	`conf`	Finding Minimum-Cost Circulations by Canceling Negative Cycles STOC Andrew V. Goldberg, Robert Endre Tarjan
1988	J	`jnl`	Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discret. Math. Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
1988	A*	`conf`	Sublinear-Time Parallel Algorithms for Matching and Related Problems FOCS Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
1987	J	`jnl`	Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. Inf. Process. Lett. Andrew V. Goldberg, Serge A. Plotkin
1987	A*	`conf`	Parallel Symmetry-Breaking in Sparse Graphs STOC Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
1987	A*	`conf`	Solving Minimum-Cost Flow Problems by Successive Approximation STOC Andrew V. Goldberg, Robert Endre Tarjan
1986	A*	`conf`	A New Approach to the Maximum Flow Problem STOC Andrew V. Goldberg, Robert Endre Tarjan
1985	A*	`conf`	Compression and Ranking STOC Andrew V. Goldberg, Michael Sipser
1985	A	`conf`	Efficient Test Generation Algorithms. ITC Andrew V. Goldberg, Karl J. Lieberherr
1984	A*	`conf`	On Finding the Exact Solution of a Zero-One Knapsack Problem STOC Andrew V. Goldberg, Alberto Marchetti-Spaccamela