Andreĭ A. Bulatov
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 5%
- Artificial Intelligence top 10%
- Statistics and Probability top 5%
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- Andrei KrokhinPeter JeavonsVíctor DalmauMartin GroheDániel MarxMarkus JalseniusMark JerrumDavid Richerby
- Topics
- Advanced Graph Theory Research (16 papers)Constraint Satisfaction and Optimization (13 papers)Complexity and Algorithms in Graphs (11 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- SHILAP Revista de lepidopterologíaCommunications of the ACMSIAM Journal on Computing
- Partner nations
- CanadaUnited KingdomRussia
In The Last Decade
Andreĭ A. Bulatov
26 papers receiving 593 citations
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 560
- Computer Networks and Communications 353
- Artificial Intelligence 132
- Statistics and Probability 100
- Discrete Mathematics and Combinatorics 77
Countries citing papers authored by Andreĭ A. Bulatov
This map shows the geographic impact of Andreĭ A. Bulatov'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 Andreĭ A. Bulatov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreĭ A. Bulatov more than expected).
Fields of papers citing papers by Andreĭ A. Bulatov
This network shows the impact of papers produced by Andreĭ A. Bulatov. 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 Andreĭ A. Bulatov. The network helps show where Andreĭ A. Bulatov may publish in the future.
Co-authorship network of co-authors of Andreĭ A. Bulatov
This figure shows the co-authorship network connecting the top 25 collaborators of Andreĭ A. Bulatov. A scholar is included among the top collaborators of Andreĭ A. Bulatov 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 Andreĭ A. Bulatov. Andreĭ A. Bulatov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | Long range actions, connectedness, and dismantlability in relational structures. | 1 |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 4 | |
| 8 | 5 | |
| 9 | 2 | |
| 10 | 6 | |
| 11 | 22 | |
| 12 | 7 | |
| 13 | 3 | |
| 14 | 68 | |
| 15 | 87 | |
| 16 | 36 | |
| 17 | 262 | |
| 18 | Amalgams of constraint satisfaction problems | 0 |
| 19 | 3 | |
| 20 | 3 |
About Andreĭ A. Bulatov
Andreĭ A. Bulatov is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Algebra and Number Theory, having authored 28 papers that have together received 668 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Constraint Satisfaction and Optimization (13 papers) and Complexity and Algorithms in Graphs (11 papers). The work is most often cited by research in Computational Theory and Mathematics (560 citations), Discrete Mathematics and Combinatorics (77 citations) and Computer Networks and Communications (353 citations). Andreĭ A. Bulatov has collaborated with scholars based in Canada, United Kingdom and Russia. Frequent co-authors include Andrei Krokhin, Peter Jeavons, Víctor Dalmau, Martin Grohe, Dániel Marx, Markus Jalsenius, Mark Jerrum, David Richerby, Arseny M. Shur and Leslie Ann Goldberg. Their work appears in journals such as SHILAP Revista de lepidopterología, Communications 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.