Boris V. Cherkassky

Publication Activity (10 Years)

Years Active: 1994-2009
Publications (10 Years): 0

Publications

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)
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
Shortest Path Feasibility Algorithms: An Experimental Evaluation. ALENEX (2008)
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM J. Comput. 28 (4) (1999)
Boris V. Cherkassky, Andrew V. Goldberg
Negative-cycle detection algorithms. Math. Program. 85 (2) (1999)
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 (1998)
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
Buckets, Heaps, Lists, and Monotone Priority Queues. SODA (1997)
Boris V. Cherkassky, Andrew V. Goldberg
On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica 19 (4) (1997)
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)
Boris V. Cherkassky, Andrew V. Goldberg
Negative-Cycle Detection Algorithms. ESA (1996)
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
Shortest paths algorithms: Theory and experimental evaluation. Math. Program. 73 (1996)
Boris V. Cherkassky, Andrew V. Goldberg
On Implementing Push-Relabel Method for the Maximum Flow Problem. IPCO (1995)
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
Shortest Paths Algorithms: Theory and Experimental Evaluation. SODA (1994)