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 the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset. - Alexander Kel'manov; Vladimir I. Khandeev; Anna Panasenko (AIST, 2018)

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)

Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case. - Alexander Kel'manov; Vladimir I. Khandeev (AIST, 2019)

On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line. - Alexander Kel'manov; Vladimir I. Khandeev (LION, 2019)

The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension. - Alexander Kel'manov; Vladimir I. Khandeev (MOTOR (2), 2019)

Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case. - Alexander Kel'manov; Vladimir I. Khandeev (NUMTA (2), 2019)

Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. - Vladimir I. Khandeev (NUMTA (2), 2019)

Randomized Algorithms for Some Sequence Clustering Problems. - Sergey A. Khamidullin; Vladimir I. Khandeev; Anna Panasenko (LION, 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)

Max-Min Problems of Searching for Two Disjoint Subsets. - Vladimir I. Khandeev; Sergey Neshchadim (OPTIMA, 2021)