9 citations · 16 across the 10 of their papers we have counts for
11 papers
Almost optimal searching of maximal subrepetitions in a word
Roman Kolpakov
For a -subrepetition in a word is a factor which exponent is less than~2 but is not less than (the exponent of the factor is the ratio of the factor length to its…
On the number of gapped repeats with arbitrary gap
Roman Kolpakov
For any functions , from to we call repeats such that as {\it -gapped repeats}. We study the possible…
Indexing and querying color sets of images
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
We aim to study the set of color sets of continuous regions of an image given as a matrix of rows over columns where each element in the matrix is an integer from $[1…
Optimal searching of gapped repeats in a word
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of {\em -gapped repeats} in strings, defined as factors with . Our ma…
Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method
Roman Kolpakov, Mikhail Posypkin
We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants…
Searching of gapped repeats and subrepetitions in a word
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin +1
A gapped repeat is a factor of the form where and are nonempty words. The period of the gapped repeat is defined as . The gapped repeat is maximal if it cann…