default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew V. Goldberg
- > Home > Persons > Andrew V. Goldberg
Publications
- 2022
[c88]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA 2022: 45:1-45:16- [i6]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR abs/2203.15805 (2022) - 2021
- [j48]Yuanyuan Dong
, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2(4) (2021) - [i5]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New instances for maximum weight independent set from a vehicle routing application. CoRR abs/2105.12623 (2021) - 2017
- [j47]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan:
Minimum-Cost Flows in Unit-Capacity Networks. Theory Comput. Syst. 61(4): 987-1010 (2017) - [j46]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - 2016
- [j45]Ittai 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) - [j44]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ACM Trans. Algorithms 13(1): 16:1-16:17 (2016) - [c87]Ittai 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 - [p1]Hannah 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 - [r3]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Labeling (2-Hop Labeling). Encyclopedia of Algorithms 2016: 932-938 - [r2]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2016: 947-951 - 2015
- [j43]Daniel 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) - [c86]Andrew 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 - [c85]Daniel 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 - [c84]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - [c83]Andrew V. Goldberg, Haim Kaplan, Sagi Hed, Robert Endre Tarjan:
Minimum Cost Flows in Graphs with Unit Capacities. STACS 2015: 406-419 - [i4]Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling. CoRR abs/1501.02492 (2015) - [i3]Hannah 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) - 2014
- [j42]Andrew V. Goldberg, Robert Endre Tarjan:
Efficient maximum flow algorithms. Commun. ACM 57(8): 82-89 (2014) - [c82]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [c81]Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, Renato F. Werneck:
Hub Labels: Theory and Practice. SEA 2014: 259-270 - 2013
- [j41]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013) - [j40]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato F. Werneck:
PHAST: Hardware-accelerated shortest path trees. J. Parallel Distributed Comput. 73(7): 940-952 (2013) - [c80]Edith 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 - [c79]Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. ICALP (1) 2013: 69-80 - [c78]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. MFCS 2013: 469-479 - [c77]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - [c75]Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Hub Label Compression. SEA 2013: 18-29 - [i2]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. CoRR abs/1304.5973 (2013) - [i1]Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner:
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013) - 2012
- [c74]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44 - [c73]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35 - [c72]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348 - 2011
- [j39]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. Games Econ. Behav. 72(1): 1-11 (2011) - [j38]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Shortest Paths in Road Networks: From Practice to Theory and Back. it Inf. Technol. 53(6): 294-301 (2011) - [c71]Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Faster Batched Shortest Paths in Road Networks. ATMOS 2011: 52-63 - [c70]Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Maximum Flows by Incremental Breadth-First Search. ESA 2011: 457-468 - [c69]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c68]Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, Renato Fonseca F. Werneck:
PHAST: Hardware-Accelerated Shortest Path Trees. IPDPS 2011: 921-931 - [c67]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146 - [c66]Ittai 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 - [c65]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387 - 2010
- [c64]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - [c63]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks. SEA 2010: 23-34 - 2009
- [j37]Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Shortest-path feasibility algorithms: An experimental evaluation. ACM J. Exp. Algorithmics 14 (2009) - [c61]Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms. ALENEX 2009: 1-13 - [c60]Michael Isard, Vijayan Prabhakaran, Jon Currey, Udi Wieder, Kunal Talwar, Andrew V. Goldberg:
Quincy: fair scheduling for distributed computing clusters. SOSP 2009: 261-276 - [e2]Andrew 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 [contents] - [e1]Camil 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, ISBN 978-0-8218-4383-3 [contents] - 2008
- [c59]Boris 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 - [r1]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008 - 2007
- [c56]Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck:
Better Landmarks Within Reach. WEA 2007: 38-51 - [c55]Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269 - 2006
- [j35]Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright:
Competitive auctions. Games Econ. Behav. 55(2): 242-269 (2006) - [c54]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. ALENEX 2006: 129-143 - [c53]Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-139 - [c52]Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi:
Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75 - 2005
- [c51]Andrew V. Goldberg, Renato Fonseca F. Werneck:
Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO 2005: 26-40 - [c50]Andrew V. Goldberg, Chris Harrelson:
Computing the shortest path: A search meets graph theory. SODA 2005: 156-165 - [c49]Andrew V. Goldberg, Jason D. Hartline:
Collusion-resistant mechanisms for single-parameter agents. SODA 2005: 620-629 - [c48]Gagan Aggarwal, Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Nicole Immorlica, Madhu Sudan:
Derandomization of auctions. STOC 2005: 619-625 - 2004
- [j34]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum skew-symmetric flows and matchings. Math. Program. 100(3): 537-568 (2004) - [c47]Andrew 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
- [c46]Cynthia Dwork, Andrew V. Goldberg, Moni Naor:
On Memory-Bound Functions for Fighting Spam. CRYPTO 2003: 426-444 - [c45]Andrew V. Goldberg, Jason D. Hartline:
Envy-free auctions for digital goods. EC 2003: 29-35 - [c44]Andrew V. Goldberg, Jason D. Hartline:
Competitiveness via consensus. SODA 2003: 215-222 - 2002
- [c43]Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Truthful and Competitive Double Auctions. ESA 2002: 361-373 - [c42]Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin:
Competitive generalized auctions. STOC 2002: 72-81 - 2001
- [j33]Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms: An Experimental Study. J. Algorithms 38(1): 51-83 (2001) - [c40]Andrew V. Goldberg, Jason D. Hartline:
Competitive Auctions for Multiple Digital Goods. ESA 2001: 416-427 - [c38]Andrew V. Goldberg, Jason D. Hartline, Andrew Wright:
Competitive auctions and digital goods. SODA 2001: 735-744 - 1999
- [j32]Boris V. Cherkassky, Andrew V. Goldberg:
Negative-cycle detection algorithms. Math. Program. 85(2): 277-311 (1999) - [j31]Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein:
Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. 28(4): 1326-1346 (1999) - [j30]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. SIAM J. Discret. Math. 12(1): 1-5 (1999) - [c37]Andrew V. Goldberg, Craig Silverstein:
Computational evaluation of hot queues. Data Structures, Near Neighbor Searches, and Methodology 1999: 49-67 - [c35]Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms. SODA 1999: 376-385 - [c34]Andrew V. Goldberg, Bernard M. E. Moret:
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA 1999: 913-914 - 1998
- [j29]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. J. ACM 45(5): 783-797 (1998) - [j28]Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin:
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. ACM J. Exp. Algorithmics 3: 8 (1998) - [c31]Andrew 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 - 1997
- [j27]Boris V. Cherkassky, Andrew V. Goldberg:
On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19(4): 390-410 (1997) - [j25]Andrew V. Goldberg, Alexander V. Karzanov:
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22(1): 90-109 (1997) - [j23]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:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c29]Andrew V. Goldberg, Satish Rao:
Beyond the Flow Decomposition Barrier. FOCS 1997: 2-11 - [c28]Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks. FOCS 1997: 32-34 - [c27]Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein:
Buckets, Heaps, Lists, and Monotone Priority Queues. SODA 1997: 83-92 - [c26]Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein:
Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333 - [c25]Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi:
Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. WAE 1997: 1-10 - 1996
- [j22]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. Comb. 16(3): 353-382 (1996) - [j21]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73: 129-174 (1996) - [c24]Boris V. Cherkassky, Andrew V. Goldberg:
Negative-Cycle Detection Algorithms. ESA 1996: 349-363 - 1995
- [c23]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum Skew-Symmetric Flows. ESA 1995: 155-170 - [c22]Boris V. Cherkassky, Andrew V. Goldberg:
On Implementing Push-Relabel Method for the Maximum Flow Problem. IPCO 1995: 157-171 - 1994
- [j18]Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. Algorithmica 11(3): 226-242 (1994) - [j17]Andrew 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) - [c20]Michel 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 - [c19]Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik:
Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA 1994: 516-525 - [c18]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. SODA 1994: 526-535 - 1993
- [j16]Ted Fischer, Andrew V. Goldberg, David J. Haglin, Serge A. Plotkin:
Approximating Matchings in Parallel. Inf. Process. Lett. 46(3): 115-118 (1993) - [j15]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. J. Algorithms 14(2): 180-213 (1993) - 1992
- [j13]Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan:
Finding minimum-cost flows by double scaling. Math. Program. 53: 243-266 (1992) - [j12]Andrew 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
- [j10]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. Math. Oper. Res. 16(2): 351-381 (1991) - [j9]Andrew 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) - [j8]Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. SIAM J. Comput. 20(3): 524-536 (1991) - [j7]Andrew V. Goldberg, Dan Gusfield:
Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel'son-Vel'ski, E. A. Dinits, and A. V. Karzanov). SIAM Rev. 33(2): 306-314 (1991) - [c14]Andrew V. Goldberg, Michael Kharitonov:
On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching 1991: 157-198 - [c13]Tomasz Radzik, Andrew V. Goldberg:
Tight Bounds on the Number of Minimum-Mean Cycle Cancellations and Related Results. SODA 1991: 110-119 - 1990
- [j6]Andrew V. Goldberg, Robert E. Tarjan:
Finding Minimum-Cost Circulations by Successive Approximation. Math. Oper. Res. 15(3): 430-466 (1990) - 1989
- [j5]Andrew 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) - [j4]Andrew V. Goldberg, Robert Endre Tarjan:
Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4): 873-886 (1989) - [c12]Michael Kharitonov, Andrew V. Goldberg, Moti Yung:
Lower Bounds for Pseudorandom Number Generators. FOCS 1989: 242-247 - [c11]Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos:
Interior-Point Methods in Parallel Computation. FOCS 1989: 350-355 - [c10]Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation. FOCS 1989: 364-369 - 1988
- [j3]Andrew V. Goldberg, Robert Endre Tarjan:
A new approach to the maximum-flow problem. J. ACM 35(4): 921-940 (1988) - [j2]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discret. Math. 1(4): 434-446 (1988) - [c9]Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. FOCS 1988: 174-185 - [c8]Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. FOCS 1988: 432-443 - [c7]Andrew V. Goldberg, Robert Endre Tarjan:
Finding Minimum-Cost Circulations by Canceling Negative Cycles. STOC 1988: 388-397 - 1987
- [j1]Andrew V. Goldberg, Serge A. Plotkin:
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs. Inf. Process. Lett. 25(4): 241-245 (1987) - [c6]Andrew V. Goldberg, Robert Endre Tarjan:
Solving Minimum-Cost Flow Problems by Successive Approximation. STOC 1987: 7-18 - [c5]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. STOC 1987: 315-324 - 1986
- [c4]Andrew V. Goldberg, Robert Endre Tarjan:
A New Approach to the Maximum Flow Problem. STOC 1986: 136-146 - 1985
- [c2]Andrew V. Goldberg, Michael Sipser:
Compression and Ranking. STOC 1985: 440-448 - 1984
- [c1]Andrew V. Goldberg, Alberto Marchetti-Spaccamela:
On Finding the Exact Solution of a Zero-One Knapsack Problem. STOC 1984: 359-368
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
