Shortest paths algorithms: Theory and experimental evaluation. - Boris V. Cherkassky; Andrew V. Goldberg; Tomasz Radzik (Math. Program., 1996)

Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. - Boris V. Cherkassky; Andrew V. Goldberg; Paul Martin 006; João C. Setubal; Jorge Stolfi (WAE, 1997)

On Implementing the Push-Relabel Method for the Maximum Flow Problem. - Boris V. Cherkassky; Andrew V. Goldberg (Algorithmica, 1997)

Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. - Boris V. Cherkassky; Andrew V. Goldberg; Paul Martin 006 (ACM J. Exp. Algorithmics, 1998)

Negative-cycle detection algorithms. - Boris V. Cherkassky; Andrew V. Goldberg (Math. Program., 1999)

Buckets, Heaps, Lists, and Monotone Priority Queues. - Boris V. Cherkassky; Andrew V. Goldberg; Craig Silverstein (SIAM J. Comput., 1999)

Shortest-path feasibility algorithms: An experimental evaluation. - Boris V. Cherkassky; Loukas Georgiadis; Andrew V. Goldberg; Robert Endre Tarjan; Renato Fonseca F. Werneck (ACM J. Exp. Algorithmics, 2009)