Andrew V. Goldberg Home Page Coauthor index pubzone.org

Facets and more with CompleteSearch

Andrew Vladislav Goldberg

Microsoft Research

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier II - Dagstuhl


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2017
j46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck: Customizable Route Planning in Road Networks. Transportation Science 51(2): 566-591 (2017)
2016
j45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck: Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016)
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan: Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13(1): 16:1-16:17 (2016)
c86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck: On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753
p1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck: Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80
e3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander S. Kulikov: Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings .Lecture Notes in Computer Science 9685, Springer 2016, ISBN 978-3-319-38850-2
r3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Renato F. Werneck: Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms 2016: 932-938
r2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCamil Demetrescu, Andrew V. Goldberg, David S. Johnson: Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2016: 947-951
2015
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller: On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015)
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck: Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015)
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck: An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153(2): 417-458 (2015)
c85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck: Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. ESA 2015: 619-630
c84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Moisés Goldszmidt, John Krumm, Kunal Talwar, Renato F. Werneck: Navigation made personal: inferring driving preferences from GPS traces. SIGSPATIAL/GIS 2015: 31:1-31:9
c83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller: On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74
c82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan: Minimum Cost Flows in Graphs with Unit Capacities. STACS 2015: 406-419
2014
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: Efficient maximum flow algorithms. Commun. ACM 57(8): 82-89 (2014)
c81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck: Robust Distance Queries on Massive Networks. ESA 2014: 321-333
c80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck: Hub Labels: Theory and Practice. SEA 2014: 259-270
2013
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko: Separating Hierarchical and General Hub Labelings .CoRR abs/1304.5973 (2013)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner: Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck: Alternative routes in road networks. ACM Journal of Experimental Algorithmics 18 (2013)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck: PHAST: Hardware-accelerated shortest path trees. J. Parallel Distrib. Comput. 73(7): 940-952 (2013)
c79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Daniel Delling, Fabian Fuchs, Andrew V. Goldberg, Moisés Goldszmidt, Renato F. Werneck: Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths. COSN 2013: 131-142
c78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan: Algorithms for Hub Label Optimization. ICALP (1) 2013: 69-80
c77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko: Separating Hierarchical and General Hub Labelings. MFCS 2013: 469-479
c76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck: Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013
c75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: The Hub Labeling Algorithm. SEA 2013: 4
c74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Renato F. Werneck: Hub Label Compression. SEA 2013: 18-29
2012
c73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck: Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44
c72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35
c71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348
2011
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan: Derandomization of auctions. Games and Economic Behavior 72(1): 1-11 (2011)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Shortest Paths in Road Networks: From Practice to Theory and Back. it - Information Technology 53(6): 294-301 (2011)
c70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63
c69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck: Maximum Flows by Incremental Breadth-First Search. ESA 2011: 457-468
c68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699
c67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck: PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931
c66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck: Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146
c65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241
c64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck: Customizable Route Planning. SEA 2011: 376-387
2010
c63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793
c62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck: Alternative Routes in Road Networks. SEA 2010: 23-34
2009
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: Shortest-path feasibility algorithms: An experimental evaluation. ACM Journal of Experimental Algorithmics 14 (2009)
c61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Two-Level Push-Relabel Algorithm for the Maximum Flow Problem. AAIM 2009: 212-225
c60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLoukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13
c59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg: Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276
e2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Yunhong Zhou: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings .Lecture Notes in Computer Science 5564, Springer 2009, ISBN 978-3-642-02157-2
e1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCamil Demetrescu, Andrew V. Goldberg, David S. Johnson: The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006 .DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74, DIMACS/AMS 2009
2008
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comput. 37(5): 1637-1655 (2008)
c58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck: Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX 2008: 118-132
c57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. ESA 2008: 466-477
r1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCamil Demetrescu, Andrew V. Goldberg, David S. Johnson: Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008
2007
c56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Point-to-Point Shortest Path Algorithms with Preprocessing. SOFSEM (1) 2007: 88-102
c55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck: Better Landmarks Within Reach. WEA 2007: 38-51
c54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou: Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269
2006
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright: Competitive auctions. Games and Economic Behavior 55(2): 242-269 (2006)
c53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Haim Kaplan, Renato F. Werneck: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143
c52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Haim Kaplan, Renato F. Werneck: Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-140
c51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIttai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi: Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75
2005
c50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Renato Fonseca F. Werneck: Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO 2005: 26-40
c49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Chris Harrelson: Computing the shortest path: A search meets graph theory. SODA 2005: 156-165
c48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline: Collusion-resistant mechanisms for single-parameter agents. SODA 2005: 620-629
c47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan: Derandomization of auctions. STOC 2005: 619-625
2004
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander V. Karzanov: Maximum skew-symmetric flows and matchings. Math. Program. 100(3): 537-568 (2004)
c46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks: A Lower Bound on the Competitive Ratio of Truthful Auctions. STACS 2004: 644-655
2003
c45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCynthia Dwork, Andrew V. Goldberg, Moni Naor: On Memory-Bound Functions for Fighting Spam. CRYPTO 2003: 426-444
c44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline: Envy-free auctions for digital goods. EC 2003: 29-35
c43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline: Competitiveness via consensus. SODA 2003: 215-222
2002
c42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin: Truthful and Competitive Double Auctions. ESA 2002: 361-373
c41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin: Competitive generalized auctions. STOC 2002: 72-81
2001
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Kostas Tsioutsiouliklis: Cut Tree Algorithms: An Experimental Study. J. Algorithms 38(1): 51-83 (2001)
c40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: A Simple Shortest Path Algorithm with Linear Average Time. ESA 2001: 230-241
c39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline: Competitive Auctions for Multiple Digital Goods. ESA 2001: 416-427
c38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Shortest Path Algorithms: Engineering Aspects. ISAAC 2001: 502-513
c37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jason D. Hartline, Andrew Wright: Competitive auctions and digital goods. SODA 2001: 735-744
1999
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg: Negative-cycle detection algorithms. Math. Program. 85(2): 277-311 (1999)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein: Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. 28(4): 1326-1346 (1999)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Satish Rao: Flows in Undirected Unit Capacity Networks. SIAM J. Discrete Math. 12(1): 1-5 (1999)
c36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Craig Silverstein: Computational evaluation of hot queues. Data Structures, Near Neighbor Searches, and Methodology 1999: 49-
c35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYuan Chen, Jan Edler, Andrew V. Goldberg, Allan Gottlieb, Sumeet Sobti, Peter N. Yianilos: A Prototype Implementation of Archival Intermemory. ACM DL 1999: 28-37
c34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Kostas Tsioutsiouliklis: Cut Tree Algorithms. SODA 1999: 376-385
c33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Bernard M. E. Moret: Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA 1999: 913-914
c32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Selecting Problems for Algorithm Evaluation. Algorithm Engineering 1999: 1-11
1998
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Satish Rao: Beyond the Flow Decomposition Barrier. J. ACM 45(5): 783-797 (1998)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg, Paul Martin: Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. ACM Journal of Experimental Algorithmics 3: 8 (1998)
c31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Peter N. Yianilos: Towards an Archival Intermemory. ADL 1998: 147-156
c30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein: An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. IPCO 1998: 338-352
c29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Recent Developments in Maximum Flow Algorithms (Invited Lecture). SWAT 1998: 1-10
1997
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg: On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19(4): 390-410 (1997)
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. J. Algorithms 22(1): 1-29 (1997)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander V. Karzanov: Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22(1): 90-109 (1997)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Kennedy: Global Price Updates Help. SIAM J. Discrete Math. 10(4): 551-572 (1997)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Faith 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: Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997)
c28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Satish Rao: Beyond the Flow Decomposition Barrier. FOCS 1997: 2-11
c27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Satish Rao: Flows in Undirected Unit Capacity Networks. FOCS 1997: 32-34
c26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein: Buckets, Heaps, Lists, and Monotone Priority Queues. SODA 1997: 83-92
c25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein: Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333
1996
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander V. Karzanov: Path Problems in Skew-Symmetric Graphs. Combinatorica 16(3): 353-382 (1996)
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik: Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996)
c24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg: Negative-Cycle Detection Algorithms. ESA 1996: 349-363
1995
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Kennedy: An efficient cost scaling algorithm for the assignment problem. Math. Program. 71: 153-177 (1995)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Scaling Algorithms for the Shortest Paths Problem. SIAM J. Comput. 24(3): 494-504 (1995)
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander V. Karzanov: Maximum Skew-Symmetric Flows. ESA 1995: 155-170
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg: On Implementing Push-Relabel Method for the Maximum Flow Problem. IPCO 1995: 157-171
1994
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomasz Radzik, Andrew V. Goldberg: Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Bruce M. Maggs, Serge A. Plotkin: A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches. IEEE Trans. Computers 43(3): 321-326 (1994)
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Optimization Algorithms For Large Networks. ESA 1994: 1-9
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson: Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik: Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alexander V. Karzanov: Path Problems in Skew-Symmetric Graphs. SODA 1994: 526-535
1993
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTed Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin: Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993)
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya: Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14(2): 180-213 (1993)
c17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: An efficient implementation of a scaling minimum-cost flow algorithm. IPCO 1993: 251-266
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Scaling Algorithms for the Shortest Paths Problem. SODA 1993: 222-231
1992
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. Inf. Process. Lett. 42(5): 249-256 (1992)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRavindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan: Finding minimum-cost flows by double scaling. Math. Program. 53: 243-266 (1992)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos: Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. 21(1): 140-150 (1992)
1991
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg: Processor-Efficient Implementation of a Maximum Flow Algorithm. Inf. Process. Lett. 38(4): 179-185 (1991)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Éva Tardos: Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 16(2): 351-381 (1991)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Michael D. Grigoriadis, Robert Endre Tarjan: Use of dynamic trees in a network simplex algorithm for the maximum flow problem. Math. Program. 50: 277-290 (1991)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Michael Sipser: Compression and Ranking. SIAM J. Comput. 20(3): 524-536 (1991)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Dan Gusfield: Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov). SIAM Review 33(2): 306-314 (1991)
c15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFarid Alizadeth, Andrew V. Goldberg: Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine. Network Flows And Matching 1991: 65-96
c14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Michael Kharitonov: On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching 1991: 157-198
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomasz Radzik, Andrew V. Goldberg: Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA 1991: 110-119
1990
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert E. Tarjan: Finding Minimum-Cost Circulations by Successive Approximation. Math. Oper. Res. 15(3): 430-466 (1990)
1989
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network. Inf. Process. Lett. 31(5): 265-271 (1989)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4): 873-886 (1989)
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Kharitonov, Andrew V. Goldberg, Moti Yung: Lower Bounds for Pseudorandom Number Generators .FOCS 1989: 242-247
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos: Interior-Point Methods in Parallel Computation .FOCS 1989: 350-355
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBaruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin: Network Decomposition and Locality in Distributed Computation .FOCS 1989: 364-369
1988
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: A new approach to the maximum-flow problem. J. ACM 35(4): 921-940 (1988)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon: Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discrete Math. 1(4): 434-446 (1988)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya: Sublinear-Time Parallel Algorithms for Matching and Related Problems .FOCS 1988: 174-185
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Éva Tardos: Combinatorial Algorithms for the Generalized Circulation Problem .FOCS 1988: 432-443
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: Finding Minimum-Cost Circulations by Canceling Negative Cycles .STOC 1988: 388-397
1987
b1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew Vladislav Goldberg: Efficient graph algorithms for sequential and parallel computers. Massachusetts Institute of Technology, Cambridge, MA, USA 1987
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin: Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. Inf. Process. Lett. 25(4): 241-245 (1987)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: Solving Minimum-Cost Flow Problems by Successive Approximation .STOC 1987: 7-18
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon: Parallel Symmetry-Breaking in Sparse Graphs .STOC 1987: 315-324
1986
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Robert Endre Tarjan: A New Approach to the Maximum Flow Problem .STOC 1986: 136-146
1985
c3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Karl J. Lieberherr: Efficient Test Generation Algorithms. ITC 1985: 508-517
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Michael Sipser: Compression and Ranking .STOC 1985: 440-448
1984
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrew V. Goldberg, Alberto Marchetti-Spaccamela: On Finding the Exact Solution of a Zero-One Knapsack Problem .STOC 1984: 359-368

Coauthor Index

1Ittai Abraham[j45] [c86] [j41] [c72] [c71] [c68] [c65] [c63] [c62] [c51]
2Gagan Aggarwal[j39] [c47]
3Ravindra K. Ahuja[j13]
4Farid Alizadeth[c15]
5Baruch Awerbuch[c10]
6Maxim A. Babenko[j44] [i4] [c83] [c78] [c54]
7Hannah Bast[p1] [i3]
8Shiri Chechik[c86]
9Chandra Chekuri[c25]
10Yuan Chen[c35]
11Boris V. Cherkassky[j37] [c58] [j32] [j31] [j28] [j27] [c26] [j21] [c24] [c22] [c19]
12Edith Cohen[c79]
13Anne Condon[j23]
14Jon Currey[c59]
15Daniel Delling[j46] [j45] [c86] [p1] [r3] [i3] [j43] [c84] [c81] [c80] [j41] [j40] [c79] [c76] [c74] [c73] [c72] [c71] [j38] [c70] [c68] [c67] [c66] [c65] [c64] [c62]
16Camil Demetrescu[r2] [e1] [r1]
17Jonathan Derryberry[c54]
18Kaustubh Deshmukh[c42]
19Cynthia Dwork[c45]
20Jan Edler[c35]
21Faith Ellen
Faith Fich
[j23]
22Amos Fiat[j45] [c71] [j39] [c68] [c63] [c47] [c41]
23Ted Fischer[j16]
24Daniel Fleischman[j43]
25Greg N. Frederickson[j23]
26Fabian Fuchs[c79]
27Cyril Gavoille[c51]
28Loukas Georgiadis[j37] [c60] [c58]
29Michel X. Goemans[c20]
30Moisés Goldszmidt[c84] [c79]
31Allan Gottlieb[c35]
32Michael D. Grigoriadis[j9]
33Anupam Gupta[j44] [c78]
34Dan Gusfield[j7]
35David J. Haglin[j16]
36Chris Harrelson[c49]
37Jason D. Hartline[j39] [j35] [c48] [c47] [c46] [c44] [c43] [c42] [c41] [c39] [c37]
38Sagi Hed[c85] [c82] [c69]
39Nicole Immorlica[j39] [c47]
40Michael Isard[c59]
41Giuseppe F. Italiano[i1]
42David S. Johnson[r2] [i1] [e1] [r1] [j23]
43Haim Kaplan[i4] [c85] [c83] [c82] [c69] [c55] [c53] [c52]
44David R. Karger[c25]
45Anna R. Karlin[j35] [c46] [c42] [c41]
46Alexander V. Karzanov[j34] [j25] [j22] [c23] [c18]
47Robert Kennedy[j24] [j20]
48Michael Kharitonov[c14] [c12]
49Pushmeet Kohli[c85]
50John Krumm[c84]
51Alexander S. Kulikov[e3]
52Matthew S. Levine[c25]
53Karl J. Lieberherr[c3]
54Michael C. Loui[j23]
55Michael Luby[c10]
56Bruce M. Maggs[j17]
57Stephen R. Mahaney
Steven Mahaney
[j23]
58Dahlia Malkhi[c51]
59Alberto Marchetti-Spaccamela[c1]
60Paul Martin 0006[j28]
61Bernard M. E. Moret[c33]
62Matthias Müller-Hannemann[p1] [i3]
63Viswanath Nagarajan[j44] [c78]
64Moni Naor[c45]
65Andreas Nowatzyk[j40] [c67]
66Jeffrey D. Oldham[c30]
67James B. Orlin[j13]
68Thomas Pajor[j46] [p1] [i3] [c81] [c76] [c64]
69Serge A. Plotkin[c30] [j17] [c20] [j16] [j15] [j12] [j10] [c11] [c10] [j2] [c9] [c8] [j1] [c5]
70Vijayan Prabhakaran[c59]
71Tomasz Radzik[j21] [j18] [c19] [c13]
72Prabhakar Raghavan[j23]
73Satish Rao[j30] [j29] [c28] [c27]
74Ilya P. Razenshteyn[j43] [i2] [c77] [c73] [c66]
75Michael E. Saks[j35] [c46]
76Peter Sanders 0001[p1] [i3]
77John E. Savage[j23]
78Ruslan Savchenko[i4] [c83] [c80] [i2] [c77]
79Alan L. Selman[j23]
80Gregory E. Shannon[j2] [c5]
81David B. Shmoys[j23] [c20] [j12] [c11]
82Craig Silverstein[j31] [c36] [c26]
83Michael Sipser[j8] [c2]
84Sumeet Sobti[c35]
85Clifford Stein[c30] [c25]
86Madhu Sudan[j39] [c47]
87Kunal Talwar[c84] [c59]
88Éva Tardos[c20] [j12] [j10] [c11] [c8]
89Robert E. Tarjan
Robert Endre Tarjan
[c85] [c82] [j42] [c69] [j37] [c60] [c58] [c54] [j13] [j9] [j6] [j5] [j4] [j3] [c7] [c6] [c4]
90Kostas Tsioutsiouliklis[j33] [c34]
91Pravin M. Vaidya[j15] [c9]
92Dorothea Wagner[p1] [i3] [i1]
93Mathias Weller[i4] [c83]
94Renato F. Werneck
Renato Fonseca F. Werneck
[j46] [j45] [c86] [p1] [r3] [i3] [j43] [c85] [c84] [c81] [c80] [j41] [j40] [c79] [c76] [c74] [c73] [c72] [c71] [j38] [c70] [c69] [c68] [c67] [c66] [c65] [c64] [c63] [c62] [j37] [c60] [c58] [c55] [c53] [c52] [c50]
95Udi Wieder[c59]
96David P. Williamson[c20]
97Andrew Wright[j35] [c37]
98Peter N. Yianilos[c35] [c31]
99Moti Yung[c12]
100Yunhong Zhou[e2] [c54]

 

Last update 2017-06-10 02:04 CEST by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page