Boris V. Cherkassky
- Computer Networks and Communications top 5%
- Computational Theory and Mathematics top 2%
- Signal Processing top 5%
- Computer Vision and Pattern Recognition top 5%
- Artificial Intelligence top 10%
- Co-authors
- Andrew V. GoldbergTomasz RadzikCraig SilversteinPaul R. MartinJoão Carlos SetúbalJorge StolfiRobert E. TarjanRenato F. Werneck
- Topics
- Complexity and Algorithms in Graphs (6 papers)Optimization and Search Problems (6 papers)Algorithms and Data Compression (3 papers)
- Partner nations
- RussiaUnited StatesUnited Kingdom
In The Last Decade
Boris V. Cherkassky
9 papers receiving 868 citations
Peers
Comparison fields: 5 of 93
- Computer Networks and Communications 303
- Computational Theory and Mathematics 259
- Signal Processing 212
- Computer Vision and Pattern Recognition 179
- Artificial Intelligence 164
Countries citing papers authored by Boris V. Cherkassky
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | 41 | |
| 3 | 59 | |
| 4 | 28 | |
| 5 | 16 | |
| 6 | 241 | |
| 7 | Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms. | 7 |
| 8 | 469 | |
| 9 | 79 |
About Boris V. Cherkassky
Boris V. Cherkassky is a scholar working on Computational Theory and Mathematics, Hardware and Architecture and Computer Graphics and Computer-Aided Design, having authored 9 papers that have together received 954 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (6 papers), Optimization and Search Problems (6 papers) and Algorithms and Data Compression (3 papers). The work is most often cited by research in Signal Processing (212 citations), Computational Theory and Mathematics (259 citations) and Transportation (109 citations). Boris V. Cherkassky has collaborated with scholars based in Russia, United States and United Kingdom. Frequent co-authors include Andrew V. Goldberg, Tomasz Radzik, Craig Silverstein, Paul R. Martin, João Carlos Setúbal, Jorge Stolfi, Robert E. Tarjan, Renato F. Werneck and Loukas Georgiadis. Their work appears in journals such as Mathematical Programming, SIAM Journal on Computing and Algorithmica.
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.