Boris V. Cherkassky

Statistics

Publications

Citations

1.6K

H-Index

Active since

1994

Affiliations

Central Economics and Mathematics Institute(Current)

Stanford University

Princeton University

King's College London

Boris V. Cherkassky is an author at Central Economics and Mathematics Institute specializing in engineering, combinatorial optimization, and computer science.

Top concepts

EngineeringComputer ScienceCombinatorial OptimizationComputational ComplexityData ScienceGraph TheoryPath ProblemsEdge ComputingQueuing TheoryAlgorithm Design

Publications per year

1994–2009

Publications

Shortest paths algorithms: Theory and experimental evaluation

Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik · Mathematical Programming · 1996 · 737 citations

Shortest Paths Algorithms, Path Planning, Network Routing Algorithm +5

On Implementing the Push—Relabel Method for the Maximum Flow Problem

Boris V. Cherkassky, Andrew V. Goldberg · Algorithmica · 1997 · 370 citations

Numerical Analysis, Engineering, Maximum Flow Problem +4

Negative-cycle detection algorithms

Boris V. Cherkassky, Andrew V. Goldberg · Mathematical Programming · 1999 · 156 citations

Statistical Signal Processing, Engineering, Negative-cycle Detection Algorithms +6

Shortest paths algorithms: theory and experimental evaluation

Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik · Symposium on Discrete Algorithms · 1994 · 154 citations

Shortest Paths Algorithms, Path Planning, Network Routing Algorithm +15

Buckets, Heaps, Lists, and Monotone Priority Queues

Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein · SIAM Journal on Computing · 1999 · 81 citations

Cluster Computing, Engineering, Hot Queues +18

1–5 of 8