Boris V. Cherkassky

12 papers A* 2A 2B 1Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2009 J jnl
Shortest-path feasibility algorithms: An experimental evaluation.
ACM J. Exp. Algorithmics
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
2008 A conf
Shortest Path Feasibility Algorithms: An Experimental Evaluation.
ALENEX
Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck
1999 J jnl
Buckets, Heaps, Lists, and Monotone Priority Queues.
SIAM J. Comput.
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
1999 J jnl
Negative-cycle detection algorithms.
Math. Program.
Boris V. Cherkassky, Andrew V. Goldberg
1998 J jnl
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms.
ACM J. Exp. Algorithmics
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin
1997 — conf
Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms.
WAE
Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi
1997 A* conf
Buckets, Heaps, Lists, and Monotone Priority Queues.
SODA
Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein
1997 J jnl
On Implementing the Push-Relabel Method for the Maximum Flow Problem.
Algorithmica
Boris V. Cherkassky, Andrew V. Goldberg
1996 A conf
Negative-Cycle Detection Algorithms.
ESA
Boris V. Cherkassky, Andrew V. Goldberg
1996 J jnl
Shortest paths algorithms: Theory and experimental evaluation.
Math. Program.
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik
1995 B conf
On Implementing Push-Relabel Method for the Maximum Flow Problem.
IPCO
Boris V. Cherkassky, Andrew V. Goldberg
1994 A* conf
Shortest Paths Algorithms: Theory and Experimental Evaluation.
SODA
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik