A. V. Pyatkin
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Industrial and Manufacturing Engineering top 5%
- Computer Networks and Communications top 10%
- Computer Vision and Pattern Recognition
- Co-authors
- A. V. Kel’manovFedor V. FominSergey KitaevSerge GaspersIgor RazgonFabrizio GrandoniÈ. Kh. GimadiMagnús M. Halldórsson
- Topics
- Advanced Graph Theory Research (26 papers)Graph Labeling and Dimension Problems (19 papers)graph theory and CDMA systems (15 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- RussiaUnited KingdomNorway
In The Last Decade
A. V. Pyatkin
52 papers receiving 389 citations
Peers
Comparison fields: 5 of 44
- Computational Theory and Mathematics 231
- Artificial Intelligence 93
- Industrial and Manufacturing Engineering 72
- Computer Networks and Communications 65
- Computer Vision and Pattern Recognition 56
Countries citing papers authored by A. V. Pyatkin
This map shows the geographic impact of A. V. Pyatkin'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 A. V. Pyatkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. V. Pyatkin more than expected).
Fields of papers citing papers by A. V. Pyatkin
This network shows the impact of papers produced by A. V. Pyatkin. 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 A. V. Pyatkin. The network helps show where A. V. Pyatkin may publish in the future.
Co-authorship network of co-authors of A. V. Pyatkin
This figure shows the co-authorship network connecting the top 25 collaborators of A. V. Pyatkin. A scholar is included among the top collaborators of A. V. Pyatkin 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 A. V. Pyatkin. A. V. Pyatkin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 4 | |
| 4 | 3 | |
| 5 | 2 | |
| 6 | 5 | |
| 7 | 1 | |
| 8 | 6 | |
| 9 | 17 | |
| 10 | 5 | |
| 11 | 4 | |
| 12 | 3 | |
| 13 | 3 | |
| 14 | 18 | |
| 15 | 1 | |
| 16 | Finding a minimum feedback vertex set in time O(1.7548 n | 4 |
| 17 | 6 | |
| 18 | Radio labeling with pre-assigned frequencies | 1 |
| 19 | 2 | |
| 20 | 1 |
About A. V. Pyatkin
A. V. Pyatkin is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Computational Theory and Mathematics, having authored 63 papers that have together received 404 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (19 papers) and graph theory and CDMA systems (15 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (52 citations), Computational Theory and Mathematics (231 citations) and Computer Graphics and Computer-Aided Design (50 citations). A. V. Pyatkin has collaborated with scholars based in Russia, United Kingdom and Norway. Frequent co-authors include A. V. Kel’manov, Fedor V. Fomin, Sergey Kitaev, Serge Gaspers, Igor Razgon, Fabrizio Grandoni, È. Kh. Gimadi, Magnús M. Halldórsson, Hajo Broersma and Viresh Patel. Their work appears in journals such as Pattern Recognition Letters, SIAM Journal on Optimization and Discrete Applied Mathematics.
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.