Roman Kolpakov
- Molecular Biology
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 5%
- Plant Science
- Genetics
- Co-authors
- Grégory KucherovMikhail PosypkinLeszek GąsieniecThierry LecroqIgor PotapovPaul SantArnaud LefebvreMichaël Rao
- Topics
- Algorithms and Data Compression (20 papers)semigroups and automata theory (18 papers)Optimization and Packing Problems (14 papers)
- Journals
- Nucleic Acids ResearchSHILAP Revista de lepidopterologíaJournal of Theoretical Biology
- Partner nations
- RussiaFranceUnited Kingdom
In The Last Decade
Roman Kolpakov
41 papers receiving 619 citations
Peers
Comparison fields: 5 of 66
- Molecular Biology 355
- Artificial Intelligence 330
- Computational Theory and Mathematics 187
- Plant Science 96
- Genetics 91
Countries citing papers authored by Roman Kolpakov
This map shows the geographic impact of Roman Kolpakov'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 Roman Kolpakov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roman Kolpakov more than expected).
Fields of papers citing papers by Roman Kolpakov
This network shows the impact of papers produced by Roman Kolpakov. 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 Roman Kolpakov. The network helps show where Roman Kolpakov may publish in the future.
Co-authorship network of co-authors of Roman Kolpakov
This figure shows the co-authorship network connecting the top 25 collaborators of Roman Kolpakov. A scholar is included among the top collaborators of Roman Kolpakov 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 Roman Kolpakov. Roman Kolpakov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 2 | |
| 3 | 1 | |
| 4 | 0 | |
| 5 | 3 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | 1 | |
| 9 | 3 | |
| 10 | 4 | |
| 11 | 24 | |
| 12 | Efficient Lower Bounds on the Number of Repetition-free Words | 3 |
| 13 | 4 | |
| 14 | 14 | |
| 15 | 38 | |
| 16 | 276 | |
| 17 | 3 | |
| 18 | 23 | |
| 19 | 12 | |
| 20 | Maximal Repetitions in Words or How to Find all Squares in Linear Time | 6 |
About Roman Kolpakov
Roman Kolpakov is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Industrial and Manufacturing Engineering, having authored 46 papers that have together received 639 indexed citations. Recurring topics across this work include Algorithms and Data Compression (20 papers), semigroups and automata theory (18 papers) and Optimization and Packing Problems (14 papers). The work is most often cited by research in Computational Theory and Mathematics (187 citations), Artificial Intelligence (330 citations) and Hardware and Architecture (49 citations). Roman Kolpakov has collaborated with scholars based in Russia, France and United Kingdom. Frequent co-authors include Grégory Kucherov, Mikhail Posypkin, Leszek Gąsieniec, Thierry Lecroq, Igor Potapov, Paul Sant, Arnaud Lefebvre, Michaël Rao, Mathieu Raffinot and Pascal Ochem. Their work appears in journals such as Nucleic Acids Research, SHILAP Revista de lepidopterología and Journal of Theoretical Biology.
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.