Boris V. Cherkassky

According to our database, Boris V. Cherkassky authored at least 7 papers between 1994 and 2008.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2008

Shortest Path Feasibility Algorithms: An Experimental Evaluation.

Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

1998

Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms.

Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin

ACM J. Exp. Algorithmics, 1998

1997

Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms.

Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, João C. Setubal, Jorge Stolfi

Proceedings of the Workshop on Algorithm Engineering, 1997

Buckets, Heaps, Lists, and Monotone Priority Queues.

Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Negative-Cycle Detection Algorithms.

Boris V. Cherkassky, Andrew V. Goldberg

Proceedings of the Algorithms, 1996

1995

On Implementing Push-Relabel Method for the Maximum Flow Problem.

Boris V. Cherkassky, Andrew V. Goldberg

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Shortest Paths Algorithms: Theory and Experimental Evaluation.

Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994