Boris V. Cherkassky

1.8k total citations
9 papers, 954 citations indexed

About

Boris V. Cherkassky is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Boris V. Cherkassky has authored 9 papers receiving a total of 954 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computational Theory and Mathematics, 6 papers in Computer Networks and Communications and 3 papers in Artificial Intelligence. Recurrent topics in Boris V. Cherkassky's work include Complexity and Algorithms in Graphs (6 papers), Optimization and Search Problems (6 papers) and Algorithms and Data Compression (3 papers). Boris V. Cherkassky is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), Optimization and Search Problems (6 papers) and Algorithms and Data Compression (3 papers). Boris V. Cherkassky collaborates with scholars based in Russia, United States and United Kingdom. Boris V. Cherkassky's co-authors include Andrew V. Goldberg, Tomasz Radzik, Craig Silverstein, João Carlos Setúbal, Jorge Stolfi, Paul R. Martin, Robert E. Tarjan, Renato F. Werneck and Loukas Georgiadis and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Algorithmica.

In The Last Decade

Boris V. Cherkassky

9 papers receiving 868 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Boris V. Cherkassky Russia	8	303	259	212	179	164	9	954
Jörg-Rüdiger Sack Canada	19	240 0.8×	205 0.8×	342 1.6×	396 2.2×	234 1.4×	102	1.3k
Tomasz Radzik United Kingdom	17	718 2.4×	348 1.3×	336 1.6×	178 1.0×	409 2.5×	54	1.5k
Kenneth J. Supowit United States	17	395 1.3×	520 2.0×	184 0.9×	278 1.6×	223 1.4×	33	1.6k
Michiel Smid Canada	17	241 0.8×	367 1.4×	267 1.3×	264 1.5×	164 1.0×	123	1.2k
Sanjiv Kapoor United States	17	269 0.9×	327 1.3×	158 0.7×	184 1.0×	85 0.5×	68	917
Joachim Gudmundsson Australia	21	286 0.9×	230 0.9×	888 4.2×	429 2.4×	216 1.3×	111	1.7k
Kasturi Varadarajan United States	22	273 0.9×	413 1.6×	290 1.4×	336 1.9×	290 1.8×	71	1.4k
Youssef Hamadi United Kingdom	17	440 1.5×	292 1.1×	135 0.6×	175 1.0×	419 2.6×	66	1.1k
Stefan Edelkamp Germany	18	433 1.4×	323 1.2×	96 0.5×	259 1.4×	946 5.8×	111	1.4k
Yuan Zhou China	22	383 1.3×	170 0.7×	117 0.6×	229 1.3×	316 1.9×	137	1.5k

Countries citing papers authored by Boris V. Cherkassky

Since Specialization

Citations

This map shows the geographic impact of Boris V. Cherkassky's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Boris V. Cherkassky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Boris V. Cherkassky more than expected).

Fields of papers citing papers by Boris V. Cherkassky

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Boris V. Cherkassky. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Boris V. Cherkassky. The network helps show where Boris V. Cherkassky may publish in the future.

Co-authorship network of co-authors of Boris V. Cherkassky

This figure shows the co-authorship network connecting the top 25 collaborators of Boris V. Cherkassky. A scholar is included among the top collaborators of Boris V. Cherkassky based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Boris V. Cherkassky. Boris V. Cherkassky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

9 of 9 papers shown

Cherkassky, Boris V., Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan, & Renato F. Werneck. (2009). Shortest-path feasibility algorithms. ACM Journal of Experimental Algorithmics. 14. 14 indexed citations

Cherkassky, Boris V. & Andrew V. Goldberg. (1999). Negative-cycle detection algorithms. Mathematical Programming. 85(2). 277–311. 59 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, & Craig Silverstein. (1999). Buckets, Heaps, Lists, and Monotone Priority Queues. SIAM Journal on Computing. 28(4). 1326–1346. 41 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, Paul R. Martin, João Carlos Setúbal, & Jorge Stolfi. (1998). Augment or push. ACM Journal of Experimental Algorithmics. 3. 8–8. 28 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, & Craig Silverstein. (1997). Buckets, heaps, lists, and monotone priority queues. Symposium on Discrete Algorithms. 83–92. 16 indexed citations

Cherkassky, Boris V. & Andrew V. Goldberg. (1997). On Implementing the Push—Relabel Method for the Maximum Flow Problem. Algorithmica. 19(4). 390–410. 241 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, Paul R. Martin, João Carlos Setúbal, & Jorge Stolfi. (1997). Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms.. 1–10. 7 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, & Tomasz Radzik. (1996). Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming. 73(2). 129–174. 469 indexed citations

Cherkassky, Boris V., Andrew V. Goldberg, & Tomasz Radzik. (1994). Shortest paths algorithms: theory and experimental evaluation. Symposium on Discrete Algorithms. 516–525. 79 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact