Concepedia

Author

Boris V. Cherkassky

Central Economics and Mathematics Institute

Also Known As

B. Cherkassky, B. V. Cherkassky, Boris V. Cherkassky

14

Publications

1.8K

Citations

11

H-Index

34

Concepts

All Affiliations

Central Economics and Mathematics InstituteStanford UniversityPrinceton UniversityKing's College London
BV

About

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

Top Concepts

#ConceptH-IndexPublicationsCitations

1

Engineering

8

8

1.6K

2

Computer Science

7

7

1.2K

3

Data Science

3

3

158

4

Education

1

1

19

5

Computer Engineering

1

1

21

Boris V. Cherkassky

×

8

Publications

1.6K

Citations

8

H-Index

YearCitations

Shortest paths algorithms: Theory and experimental evaluation

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

Mathematical Programming

1996

737

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

Boris V. Cherkassky, Andrew V. Goldberg

Algorithmica

1997

370

Negative-cycle detection algorithms

Boris V. Cherkassky, Andrew V. Goldberg

Mathematical Programming

1999

156

Shortest paths algorithms: theory and experimental evaluation

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

Symposium on Discrete Algorithms

1994

154

Buckets, Heaps, Lists, and Monotone Priority Queues

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

SIAM Journal on Computing

1999

81

Augment or push

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

ACM Journal of Experimental Algorithmics

1998

56

Buckets, heaps, lists, and monotone priority queues

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

Symposium on Discrete Algorithms

1997

21

Shortest-path feasibility algorithms

Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg,

ACM Journal of Experimental Algorithmics

2009

19

Page 1