A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. - Alexander V. Kel'manov; Byeungwoo Jeon (IEEE Trans. Signal Process., 2004)

A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets. - Alexandr E. Galashov; Alexander V. Kel'manov (Autom. Remote. Control., 2014)

On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin (AIST, 2016)

On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. - Anton V. Eremeev; Alexander Kelmanov; Artem V. Pyatkin (DOOR (Supplement), 2016)

An Exact Pseudopolynomial Algorithm for a Problem of Finding a Family of Disjoint Subsets. - Alexandr E. Galashov; Alexander Kelmanov (DOOR (Supplement), 2016)

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

A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem. - Alexander Kel'manov; Anna Motkova (DOOR, 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)

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. - Anton V. Eremeev; Alexander V. Kel'manov; Artem V. Pyatkin; Igor A. Ziegler (AIST, 2017)

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

An Approximation Scheme for a Weighted Two-Cluster Partition Problem. - Alexander Kel'manov; Anna Motkova; Vladimir Shenmaier (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)

On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences. - Alexander Kel'manov; Ludmila Mikhailova; Semyon Romanchenko (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)

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

Maximum Diversity Problem with Squared Euclidean Distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (MOTOR, 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)

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)

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)

Selecting a subset of diverse points based on the squared euclidean distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2022)