Andrei Krokhin

2.3k total citations
57 papers, 847 citations indexed

About

Andrei Krokhin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Algebra and Number Theory. According to data from OpenAlex, Andrei Krokhin has authored 57 papers receiving a total of 847 indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 31 papers in Computer Networks and Communications and 10 papers in Algebra and Number Theory. Recurrent topics in Andrei Krokhin's work include Advanced Graph Theory Research (35 papers), Constraint Satisfaction and Optimization (29 papers) and Complexity and Algorithms in Graphs (24 papers). Andrei Krokhin is often cited by papers focused on Advanced Graph Theory Research (35 papers), Constraint Satisfaction and Optimization (29 papers) and Complexity and Algorithms in Graphs (24 papers). Andrei Krokhin collaborates with scholars based in United Kingdom, Sweden and Spain. Andrei Krokhin's 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 and has published in prestigious journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Andrei Krokhin

52 papers receiving 753 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andrei Krokhin United Kingdom 15 668 542 200 98 43 57 847
Manuel Bodirsky Germany 16 586 0.9× 408 0.8× 264 1.3× 66 0.7× 159 3.7× 82 853
J. Flum Germany 5 572 0.9× 197 0.4× 227 1.1× 32 0.3× 59 1.4× 10 714
Albert Atserias Spain 12 339 0.5× 184 0.3× 230 1.1× 116 1.2× 33 0.8× 48 498
János Demetrovics Hungary 13 245 0.4× 227 0.4× 206 1.0× 220 2.2× 41 1.0× 84 504
John Franco United States 12 334 0.5× 327 0.6× 305 1.5× 96 1.0× 19 0.4× 33 557
Anuj Dawar United Kingdom 15 591 0.9× 119 0.2× 327 1.6× 25 0.3× 62 1.4× 68 697
Heribert Vollmer Germany 15 652 1.0× 197 0.4× 486 2.4× 13 0.1× 13 0.3× 88 850
Richard Statman United States 7 300 0.4× 103 0.2× 372 1.9× 57 0.6× 35 0.8× 29 492
S. Arumugam India 14 534 0.8× 119 0.2× 33 0.2× 34 0.3× 43 1.0× 131 703
Martin Farber Canada 15 1.0k 1.5× 239 0.4× 46 0.2× 16 0.2× 237 5.5× 17 1.1k

Countries citing papers authored by Andrei Krokhin

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Kozik, Marcin, et al.. (2024). 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. Jagiellonian University Repository (Jagiellonian University). 1–12. 1 indexed citations
2.
Krokhin, Andrei, et al.. (2023). Topology and Adjunction in Promise Constraint Satisfaction. SIAM Journal on Computing. 52(1). 38–79.
3.
Krokhin, Andrei, et al.. (2023). Topology and adjunction in promise constraint satisfaction. Durham Research Online (Durham University). 6 indexed citations
4.
Bulatov, Andreĭ A., Venkatesan Guruswami, Andrei Krokhin, & Dániel Marx. (2016). The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
5.
Jeavons, Peter, Andrei Krokhin, & Stanislav Živný. (2014). The Complexity of Valued Constraint Satisfaction. Durham Research Online (Durham University). 2(113). 9 indexed citations
6.
Krokhin, Andrei, et al.. (2011). The Complexity of the List Homomorphism Problem for Graphs. Theory of Computing Systems. 51(2). 143–178. 11 indexed citations
7.
Dalmau, Víctor, et al.. (2010). CSP duality and trees of bounded pathwidth. Theoretical Computer Science. 411(34-36). 3188–3208. 4 indexed citations
8.
Jeavons, Peter, et al.. (2009). The complexity of constraint satisfaction games and QCSP. Information and Computation. 207(9). 923–944. 22 indexed citations
9.
Jönsson, Peter, et al.. (2009). Hard constraint satisfaction problems have hard gaps at location 1. Theoretical Computer Science. 410(38-40). 3856–3874. 14 indexed citations
10.
Dalmau, Víctor & Andrei Krokhin. (2008). Majority constraints have bounded pathwidth duality. European Journal of Combinatorics. 29(4). 821–837. 19 indexed citations
11.
Jönsson, Peter & Andrei Krokhin. (2008). Computational complexity of auditing finite attributes in statistical databases. Journal of Computer and System Sciences. 74(5). 898–909. 1 indexed citations
12.
Dalmau, Víctor, Andrei Krokhin, & Benoît Larose. (2007). Retractions onto series-parallel posets. Discrete Mathematics. 308(11). 2104–2114. 1 indexed citations
13.
Jönsson, Peter & Andrei Krokhin. (2007). Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. Journal of Computer and System Sciences. 73(5). 691–702. 5 indexed citations
14.
Cohen, David A., Martin Cooper, Peter Jeavons, & Andrei Krokhin. (2006). The complexity of soft constraint satisfaction. Artificial Intelligence. 170(11). 983–1016. 48 indexed citations
15.
Cohen, David A., Martin Cooper, Peter Jeavons, & Andrei Krokhin. (2005). Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics. 149(1-3). 53–72. 22 indexed citations
16.
Jönsson, Peter & Andrei Krokhin. (2004). Recognizing frozen variables in constraint satisfaction problems. Theoretical Computer Science. 329(1-3). 93–113. 7 indexed citations
17.
Jönsson, Peter & Andrei Krokhin. (2004). Complexity classification in qualitative temporal constraint reasoning. Artificial Intelligence. 160(1-2). 35–51. 9 indexed citations
18.
Cohen, David A., Martin Cooper, Peter Jeavons, & Andrei Krokhin. (2004). A Maximal Tractable Class of Soft Constraints. Journal of Artificial Intelligence Research. 22. 1–22. 2 indexed citations
19.
Krokhin, Andrei & Peter Jönsson. (2003). Recognizing Frozen Variables in Constraint Satisfaction Problems. Electronic colloquium on computational complexity. 1 indexed citations
20.
Krokhin, Andrei, Peter Jeavons, & Peter Jönsson. (2001). A complete classification of complexity in Allen's algebra in the presence of a non-trivial basic relation. Oxford University Research Archive (ORA) (University of Oxford). 83–88. 5 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

Breakdown of academic impact, for papers by Manuel Bodirsky Breakdown of academic impact, for papers by J. Flum Breakdown of academic impact, for papers by Albert Atserias Breakdown of academic impact, for papers by János Demetrovics Breakdown of academic impact, for papers by John Franco Breakdown of academic impact, for papers by Anuj Dawar Breakdown of academic impact, for papers by Heribert Vollmer Breakdown of academic impact, for papers by Richard Statman Breakdown of academic impact, for papers by S. Arumugam Breakdown of academic impact, for papers by Martin Farber
Rankless by CCL
2026