Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence. - Alexander Kelmanov; Sergey A. Khamidullin; Semyon Romanchenko (DOOR (Supplement), 2016)

An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities. - Alexander Kel'manov; Ludmila Mikhailova; Sergey A. Khamidullin; Vladimir I. Khandeev (DOOR, 2016)

A Randomized Algorithm for 2-Partition of a Sequence. - Alexander Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev (AIST, 2017)

Exact pseudopolynomial algorithm for one sequence partitioning problem. - Alexander V. Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev (Autom. Remote. Control., 2017)

Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. - Alexander Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev; Artem V. Pyatkin (LION, 2018)

Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence. - Alexander Kel'manov; Sergey A. Khamidullin; Anna Panasenko (LION, 2019)

2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence. - Alexander Kel'manov; Sergey A. Khamidullin; Anna Panasenko (NUMTA (2), 2019)

Randomized Algorithms for Some Sequence Clustering Problems. - Sergey A. Khamidullin; Vladimir I. Khandeev; Anna Panasenko (LION, 2020)

Simultaneous Detection and Discrimination of Subsequences Which Are Nonlinearly Extended Elements of the Given Sequences Alphabet in a Quasiperiodic Sequence. - Liudmila Mikhailova; Sergey A. Khamidullin (OPTIMA, 2020)

Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence. - Alexander Kel'manov; Sergey A. Khamidullin; Vladimir I. Khandeev; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2020)