Alexander Chagrov
About
In The Last Decade
Alexander Chagrov
17 papers receiving 495 citations
Peers
Comparison fields: 5 of 30
- Artificial Intelligence 511
- Computational Theory and Mathematics 460
- Computer Networks and Communications 20
- Algebra and Number Theory 13
- Geometry and Topology 12
Countries citing papers authored by Alexander Chagrov
This map shows the geographic impact of Alexander Chagrov'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 Alexander Chagrov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Chagrov more than expected).
Fields of papers citing papers by Alexander Chagrov
This network shows the impact of papers produced by Alexander Chagrov. 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 Alexander Chagrov. The network helps show where Alexander Chagrov may publish in the future.
Co-authorship network of co-authors of Alexander Chagrov
This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Chagrov. A scholar is included among the top collaborators of Alexander Chagrov 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 Alexander Chagrov. Alexander Chagrov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | The truth about algorithmic problems in correspondence theory | 13 |
| 2 | How many variables does one need to prove PSpace-hardness of modal logics | 22 |
| 3 | 287 | |
| 4 | Modal Logic (Oxford Logic Guides, vol. 35) | 121 |
| 5 | Sahlqvist formulas are not so elementary even above S4 | 4 |
| 6 | Algorithmic aspects of propositional tense logics. | 3 |
| 7 | 5 | |
| 8 | 3 | |
| 9 | 14 | |
| 10 | 12 | |
| 11 | 25 | |
| 12 | 22 | |
| 13 | On Halldén-completness of intermediate and modal logics | 1 |
| 14 | 9 | |
| 15 | 9 | |
| 16 | An essay in complexity aspects of modal and intermediate calculi | 1 |
| 17 | Possibilities of the classical interpretations of intuitionistic logic | 1 |
| 18 | 5 |
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.