A. V. Kel'manov, S. A. Khamidullin, “Posterior detection of a given number of identical subsequences in a quasi-periodic sequence”, Zh. Vychisl. Mat. Mat. Fiz., 41:5 (2001), 807–820; Comput. Math. Math. Phys., 41:5 (2001), 762

This publication is cited in the following 43 articles:

A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “The minimization problem for the sum of weighted convolution differences: the case of a given number of elements in the sum”, Num. Anal. Appl., 13:2 (2020), 103–116
Kel'manov A. Khamidullin S. Panasenko A., “2-Approximation Polynomial-Time Algorithm For a Cardinality-Weighted 2-Partitioning Problem of a Sequence”, Numerical Computations: Theory and Algorithms, Pt II, Lecture Notes in Computer Science, 11974, ed. Sergeyev Y. Kvasov D., Springer International Publishing Ag, 2020, 386–393
Kel'manov V A. Khandeev I V., “On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line”, Learning and Intelligent Optimization, Lion, Lecture Notes in Computer Science, 11968, ed. Matsatsinis N. Marinakis Y. Pardalos P., Springer International Publishing Ag, 2020, 46–52
Kel'manov A. Khamidullin S. Panasenko A., “Exact Algorithm For One Cardinality-Weighted 2-Partitioning Problem of a Sequence”, Learning and Intelligent Optimization, Lion, Lecture Notes in Computer Science, 11968, ed. Matsatsinis N. Marinakis Y. Pardalos P., Springer International Publishing Ag, 2020, 135–145
Kel'manov A. Khamidullin S. Mikhailova L. Ruzankin P., “Polynomial-Time Solvability of One Optimization Problem Induced By Processing and Analyzing Quasiperiodic Ecg and Ppg Signals”, Optimization and Applications, Optima 2019, Communications in Computer and Information Science, 1145, ed. Jacimovic M. Khachay M. Malkova V. Posypkin M., Springer International Publishing Ag, 2020, 88–101
Kel'manov A. Khamidullin S. Khandeev V. Pyatkin A., “Exact Algorithms For Two Integer-Valued Problems of Searching For the Largest Subset and Longest Subsequence”, Ann. Math. Artif. Intell., 88:1-3 (2020), 157–168
A. V. Kel'manov, L. V. Mikhailova, P. S. Ruzankin, S. A. Khamidullin, “Problem of minimizing a sum of differences of weighted convolutions”, Comput. Math. Math. Phys., 60:12 (2020), 1951–1963
Kel'manov A.V. Khandeev V.I., “On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line”, Dokl. Math., 100:1 (2019), 339–342
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “A randomized algorithm for a sequence 2-clustering problem”, Comput. Math. Math. Phys., 58:12 (2018), 2078–2085
Kel'manov A., Khamidullin S., Khandeev V., “A Randomized Algorithm For 2-Partition of a Sequence”, Analysis of Images, Social Networks and Texts, Aist 2017, Lecture Notes in Computer Science, 10716, eds. VanDerAalst W., Ignatov D., Khachay M., Kuznetsov S., Lempitsky V., Lomazova I., Loukachevitch N., Napoli A., Panchenko A., Pardalos P., Savchenko A., Wasserman S., Springer International Publishing Ag, 2018, 313–322
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “Exact pseudopolynomial algorithm for one sequence partitioning problem”, Autom. Remote Control, 78:1 (2017), 67–74
A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “An approximation scheme for a problem of finding a subsequence”, Num. Anal. Appl., 10:4 (2017), 313–323
A. V. Kel'manov, S. A. Khamidullin, V. I. Khandeev, “Fully polynomial-time approximation scheme for a sequence $2$ -clustering problem”, J. Appl. Industr. Math., 10:2 (2016), 209–219
A. V. Kel'manov, S. A. Khamidullin, “An approximation polynomial-time algorithm for a sequence bi-clustering problem”, Comput. Math. Math. Phys., 55:6 (2015), 1068–1076
A. V. Kelmanov, S. A. Khamidullin, “Approximation algorithm for one problem of partitioning a sequence”, J. Appl. Industr. Math., 8:2 (2014), 236–244
A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “Tochnye psevdopolinomialnye algoritmy dlya nekotorykh trudnoreshaemykh zadach poiska podposledovatelnosti vektorov”, Zh. vychisl. matem. i matem. fiz., 53:1 (2013), 143–153
A. V. Kel'manov, A. V. Pyatkin, “On the complexity of some vector sequence clustering problems”, J. Appl. Industr. Math., 7:3 (2013), 363–369
A. V. Kel'manov, L. V. Mikhailova, “Recognition of a sequence as a structure containing series of recurring vectors from an alphabet”, Comput. Math. Math. Phys., 53:7 (2013), 1044–1055
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Approximation algorithms for some NP-hard problems of searching a vectors subsequence”, J. Appl. Industr. Math., 6:4 (2012), 443–450
A. V. Kelmanov, A. V. Pyatkin, “O slozhnosti nekotorykh zadach vybora podposledovatelnosti vektorov”, Zh. vychisl. matem. i matem. fiz., 52:12 (2012), 2284–2291