Goldberg, Andrew V
2959  results:
Search for persons X
?
2

Minimum-Cost Flows in Unit-Capacity Networks:

Goldberg, Andrew V. ; Hed, Sagi ; Kaplan, Haim.
Theory of Computing Systems.  61 (2017)  4 - p. 987-1010 , 2017
 
?
 
?
4

Experimental Algorithms 

15th International Symposium, SEA 2016, St. Petersburg, Rus...  Lecture Notes in Computer Science ; 9685;Theoretical Computer Science and General Issues ; 9685;SpringerLink, Bücher;Springer eBook Collection, Computer Science
 
?
5

On dynamic approximate shortest paths for planar graphs wit..:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Abraham, Ittai ; Chechik, Shiri ; Delling, Daniel.. - p. 740-753 , 2016
 
?
6

Algorithms for Hub Label Optimization:

Babenko, Maxim ; Goldberg, Andrew V. ; Gupta, Anupam.
ACM Transactions on Algorithms.  13 (2016)  1 - p. 1-17 , 2016
 
?
7

Algorithms for Hub Label Optimization:

Babenko, Maxim ; Goldberg, Andrew V. ; Gupta, Anupam.
ACM Transactions on Algorithms (TALG).  13 (2016)  1 - p. 1-17 , 2016
 
?
10

Navigation made personal : inferring driving preferences..:

, In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems,
 
?
11

Efficient maximum flow algorithms:

Goldberg, Andrew V. ; Tarjan, Robert E.
Communications of the ACM.  57 (2014)  8 - p. 82-89 , 2014
 
?
13

Efficient maximum flow algorithms:

Goldberg, Andrew V. ; Tarjan, Robert E.
Communications of the ACM.  57 (2014)  8 - p. 82-89 , 2014
 
?
14

Scalable similarity estimation in social networks : clos..:

, In: Proceedings of the first ACM conference on Online social networks,
Cohen, Edith ; Delling, Daniel ; Fuchs, Fabian... - p. 131-142 , 2013
 
?
15

PHAST: Hardware-accelerated shortest path trees:

Delling, Daniel ; Goldberg, Andrew V. ; Nowatzyk, Andreas.
Journal of Parallel and Distributed Computing.  73 (2013)  7 - p. 940-952 , 2013
 
1-15