
Search the dblp DataBase
Boris V. Cherkassky:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Boris V. Cherkassky, Andrew V. Goldberg
NegativeCycle Detection Algorithms. [Citation Graph (0, 0)][DBLP] ESA, 1996, pp:349363 [Conf]
 Boris V. Cherkassky, Andrew V. Goldberg
On Implementing PushRelabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:157171 [Conf]
 Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
Shortest Paths Algorithms: Theory and Experimental Evaluation. [Citation Graph (0, 0)][DBLP] SODA, 1994, pp:516525 [Conf]
 Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP] SODA, 1997, pp:8392 [Conf]
 Boris V. Cherkassky, Andrew V. Goldberg
On Implementing the PushRelabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:390410 [Journal]
 Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
Augment or Push: A Computational Study of Bipartite Matching and UnitCapacity Flow Algorithms. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:8 [Journal]
 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:129174 [Journal]
 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:13261346 [Journal]
Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
