9 citations · 16 across the 10 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.FL2015★ 6 cited
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…
cs.DS2015
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…