Andrei Krokhin
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 2%
- Artificial Intelligence top 10%
- Signal Processing top 10%
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Peter JeavonsAndreĭ A. BulatovPeter JönssonVíctor DalmauDavid A. CohenMartin CooperAndreǐ A. BulatovBenoît Larose
- Topics
- Advanced Graph Theory Research (35 papers)Constraint Satisfaction and Optimization (29 papers)Complexity and Algorithms in Graphs (24 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsDiscrete Mathematics and Combinatorics
- Partner nations
- United KingdomSwedenSpain
In The Last Decade
Andrei Krokhin
52 papers receiving 753 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 668
- Computer Networks and Communications 542
- Artificial Intelligence 200
- Signal Processing 98
- Discrete Mathematics and Combinatorics 43
Countries citing papers authored by Andrei Krokhin
This map shows the geographic impact of Andrei Krokhin'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 Andrei Krokhin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrei Krokhin more than expected).
Fields of papers citing papers by Andrei Krokhin
This network shows the impact of papers produced by Andrei Krokhin. 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 Andrei Krokhin. The network helps show where Andrei Krokhin may publish in the future.
Co-authorship network of co-authors of Andrei Krokhin
This figure shows the co-authorship network connecting the top 25 collaborators of Andrei Krokhin. A scholar is included among the top collaborators of Andrei Krokhin 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 Andrei Krokhin. Andrei Krokhin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 6 | |
| 4 | 4 | |
| 5 | The Complexity of Valued Constraint Satisfaction | 9 |
| 6 | 11 | |
| 7 | 4 | |
| 8 | 22 | |
| 9 | 14 | |
| 10 | 19 | |
| 11 | 1 | |
| 12 | 1 | |
| 13 | 5 | |
| 14 | 48 | |
| 15 | 22 | |
| 16 | 7 | |
| 17 | 9 | |
| 18 | 2 | |
| 19 | Recognizing Frozen Variables in Constraint Satisfaction Problems | 1 |
| 20 | A complete classification of complexity in Allen's algebra in the presence of a non-trivial basic relation | 5 |
About Andrei Krokhin
Andrei Krokhin is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory and Computer Networks and Communications, having authored 57 papers that have together received 847 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (35 papers), Constraint Satisfaction and Optimization (29 papers) and Complexity and Algorithms in Graphs (24 papers). The work is most often cited by research in Computational Theory and Mathematics (668 citations), Computer Networks and Communications (542 citations) and Discrete Mathematics and Combinatorics (43 citations). Andrei Krokhin has collaborated with scholars based in United Kingdom, Sweden and Spain. Frequent co-authors include Peter Jeavons, Andreĭ A. Bulatov, Peter Jönsson, Víctor Dalmau, David A. Cohen, Martin Cooper, Andreǐ A. Bulatov, Benoît Larose, Anna Huber and Libor Barto. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.
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.