Search the dblp DataBase

Publications of Author

1. Boris V. Cherkassky, Andrew V. Goldberg
   Negative-Cycle Detection Algorithms. [Citation Graph (0, 0)][DBLP]
   ESA, 1996, pp:349-363 [Conf]
   
2. Boris V. Cherkassky, Andrew V. Goldberg
   On Implementing Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
   IPCO, 1995, pp:157-171 [Conf]
   
3. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
   Shortest Paths Algorithms: Theory and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
   SODA, 1994, pp:516-525 [Conf]
   
4. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
   Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP]
   SODA, 1997, pp:83-92 [Conf]
   
5. Boris V. Cherkassky, Andrew V. Goldberg
   On Implementing the Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1997, v:19, n:4, pp:390-410 [Journal]
   
6. Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
   Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:8- [Journal]
   
7. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
   Shortest paths algorithms: Theory and experimental evaluation. [Citation Graph (0, 0)][DBLP]
   Math. Program., 1996, v:73, n:, pp:129-174 [Journal]
   
8. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
   Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1999, v:28, n:4, pp:1326-1346 [Journal]
   
9. 
   Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP]