Roman Kolpakov

1.4k total citations
46 papers, 639 citations indexed

About

Roman Kolpakov is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Industrial and Manufacturing Engineering. According to data from OpenAlex, Roman Kolpakov has authored 46 papers receiving a total of 639 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 21 papers in Artificial Intelligence and 14 papers in Industrial and Manufacturing Engineering. Recurrent topics in Roman Kolpakov's work include Algorithms and Data Compression (20 papers), semigroups and automata theory (18 papers) and Optimization and Packing Problems (14 papers). Roman Kolpakov is often cited by papers focused on Algorithms and Data Compression (20 papers), semigroups and automata theory (18 papers) and Optimization and Packing Problems (14 papers). Roman Kolpakov collaborates with scholars based in Russia, France and United Kingdom. Roman Kolpakov's co-authors include Grégory Kucherov, Mikhail Posypkin, Leszek Gąsieniec, Arnaud Lefebvre, Paul Sant, Thierry Lecroq, Igor Potapov, Michaël Rao, Mathieu Raffinot and Peter Clote and has published in prestigious journals such as Nucleic Acids Research, SHILAP Revista de lepidopterología and Journal of Theoretical Biology.

In The Last Decade

Roman Kolpakov

41 papers receiving 619 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Roman Kolpakov Russia	9	355	330	187	96	91	46	639
Jesper Jansson Japan	16	413 1.2×	237 0.7×	129 0.7×	47 0.5×	215 2.4×	76	651
Solon P. Pissis United Kingdom	13	348 1.0×	350 1.1×	122 0.7×	64 0.7×	65 0.7×	115	700
John Karro United States	10	434 1.2×	201 0.6×	60 0.3×	158 1.6×	116 1.3×	23	843
Alexandru I. Tomescu Finland	11	236 0.7×	147 0.4×	121 0.6×	33 0.3×	44 0.5×	68	437
Nadia Pisanti Italy	11	363 1.0×	191 0.6×	54 0.3×	91 0.9×	160 1.8×	47	519
Enno Ohlebusch Germany	16	635 1.8×	748 2.3×	227 1.2×	186 1.9×	119 1.3×	51	1.1k
John Tromp Canada	16	1.1k 3.0×	851 2.6×	206 1.1×	191 2.0×	154 1.7×	39	1.5k
Gianluca Della Vedova Italy	15	526 1.5×	214 0.6×	50 0.3×	102 1.1×	192 2.1×	68	801
David Fernández‐Baca United States	17	503 1.4×	147 0.4×	143 0.8×	127 1.3×	351 3.9×	68	1.1k
Szymon Grabowski Poland	14	578 1.6×	642 1.9×	69 0.4×	90 0.9×	68 0.7×	78	948

Countries citing papers authored by Roman Kolpakov

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kolpakov, Roman & Mikhail Posypkin. (2024). Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm. Concurrency and Computation Practice and Experience. 36(18). 2 indexed citations

Kolpakov, Roman & Mikhail Posypkin. (2020). Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. Discrete Mathematics and Applications. 30(5). 313–325. 2 indexed citations

Kolpakov, Roman & Mikhail Posypkin. (2020). The scalability analysis of a parallel tree search algorithm. Optimization Letters. 14(8). 2211–2226. 1 indexed citations

Crochemore, Maxime, Roman Kolpakov, & Grégory Kucherov. (2019). Optimal bounds for computing α-gapped repeats. Information and Computation. 268. 104434–104434.

Kolpakov, Roman & Mikhail Posypkin. (2018). On the best choice of a branching variable in the subset sum problem. Discrete Mathematics and Applications. 28(1). 29–34. 3 indexed citations

Kolpakov, Roman. (2018). On the number of gapped repeats with arbitrary gap. Theoretical Computer Science. 723. 11–22. 1 indexed citations

Belazzougui, Djamal, Roman Kolpakov, & Mathieu Raffinot. (2013). Various improvements to text fingerprinting. Journal of Discrete Algorithms. 22. 1–18. 1 indexed citations

Kolpakov, Roman & Mikhail Posypkin. (2013). Верхняя оценка числа ветвлений для задачи о сумме подмножеств. 1 indexed citations

Kolpakov, Roman. (2011). On primary and secondary repetitions in words. Theoretical Computer Science. 418. 71–81. 3 indexed citations

10.

Kolpakov, Roman & Michaël Rao. (2011). On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. Theoretical Computer Science. 412(46). 6507–6516. 4 indexed citations

11.

Kolpakov, Roman & Mikhail Posypkin. (2011). Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem. Journal of Computer and Systems Sciences International. 50(5). 756–765. 2 indexed citations

12.

Kolpakov, Roman, Roman Kolpakov, Mikhail Posypkin, & Mikhail Posypkin. (2010). Верхняя и нижняя оценки трудоемкости метода ветвей и границ для задачи о ранце. Дискретная математика. 22(1). 58–73. 3 indexed citations

13.

Kolpakov, Roman & Grégory Kucherov. (2009). Searching for gapped palindromes. Theoretical Computer Science. 410(51). 5365–5373. 24 indexed citations

14.

Kolpakov, Roman & Grégory Kucherov. (2004). Periodic Structures in Words. HAL (Le Centre pour la Communication Scientifique Directe). 399–442. 3 indexed citations

15.

Kolpakov, Roman, et al.. (2004). Linear-time computation of local periods. Theoretical Computer Science. 326(1-3). 229–240. 14 indexed citations

16.

Kolpakov, Roman & Grégory Kucherov. (2003). Finding maximal repetitions in a word in linear time. 596–604. 136 indexed citations

17.

Kolpakov, Roman & Grégory Kucherov. (2003). Finding approximate repetitions under Hamming distance. Theoretical Computer Science. 303(1). 135–156. 38 indexed citations

18.

Kolpakov, Roman & Grégory Kucherov. (2002). Finding repeats with fixed gap. 162–168. 23 indexed citations

19.

Kolpakov, Roman, et al.. (1999). On repetition-free binary words of minimal density. Theoretical Computer Science. 218(1). 161–175. 12 indexed citations

20.

Kolpakov, Roman & Grégory Kucherov. (1998). Maximal Repetitions in Words or How to Find all Squares in Linear Time. HAL (Le Centre pour la Communication Scientifique Directe). 6 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