Alexander Kel'manov

14 papers Misc 5Journal 1Unranked 8
YearRankTypeTitle / Venue / Authors
2020 J jnl
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence.
Ann. Math. Artif. Intell.
Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin
2019 — conf
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
NUMTA (2)
Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko
2019 — conf
Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence.
LION
Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko
2019 — conf
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case.
NUMTA (2)
Alexander Kel'manov, Vladimir I. Khandeev
2019 Misc conf
Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case.
AIST
Alexander Kel'manov, Vladimir I. Khandeev
2019 — conf
On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line.
LION
Alexander Kel'manov, Vladimir I. Khandeev
2019 — conf
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension.
MOTOR (2)
Alexander Kel'manov, Vladimir I. Khandeev
2018 — conf
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.
LION
Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev, Artem V. Pyatkin
2018 Misc conf
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset.
AIST
Alexander Kel'manov, Vladimir I. Khandeev, Anna Panasenko
2018 Misc conf
On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences.
AIST
Alexander Kel'manov, Ludmila Mikhailova, Semyon Romanchenko
2017 Misc conf
A Randomized Algorithm for 2-Partition of a Sequence.
AIST
Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev
2017 Misc conf
An Approximation Scheme for a Weighted Two-Cluster Partition Problem.
AIST
Alexander Kel'manov, Anna Motkova, Vladimir Shenmaier
2016 — conf
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem.
DOOR
Alexander Kel'manov, Anna Motkova
2016 — conf
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities.
DOOR
Alexander Kel'manov, Ludmila Mikhailova, Sergey A. Khamidullin, Vladimir I. Khandeev