Alexander V. Kel'manov Alexander Kel'manov Alexander Kelmanov http://math.nsc.ru/~kelmanov/index_ENG.htm https://scholar.google.com/citations?user=LgRz630AAAAJ https://orcid.org/0000-0001-7757-7228 https://www.researcherid.com/rid/Q-9189-2016 https://www.scopus.com/authid/detail.uri?authorId=57200965248 Sobolev Institute of Mathematics, Novosibirsk, Russia
Anton V. Eremeev Alexander V. Kel'manov Mikhail Y. Kovalyov Artem V. Pyatkin Selecting a subset of diverse points based on the squared euclidean distance. 965-977 2022 90 Ann. Math. Artif. Intell. 7-9 https://doi.org/10.1007/s10472-021-09773-z https://www.wikidata.org/entity/Q114227641 db/journals/amai/amai90.html#EremeevKKP22
Alexander Kel'manov Sergey A. Khamidullin Vladimir I. Khandeev Artem V. Pyatkin Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence. 157-168 2020 88 Ann. Math. Artif. Intell. 1-3 https://doi.org/10.1007/s10472-019-09623-z db/journals/amai/amai88.html#KelmanovKKP20
Alexander Kel'manov Vladimir I. Khandeev Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case. 377-387 2019 AIST https://doi.org/10.1007/978-3-030-37334-4_34 conf/aist/2019 db/conf/aist/aist2019.html#KelmanovK19 Alexander Kel'manov Vladimir I. Khandeev On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line. 46-52 2019 LION https://doi.org/10.1007/978-3-030-38629-0_4 conf/lion/2019 db/conf/lion/lion2019.html#KelmanovK19 Alexander Kel'manov Sergey A. Khamidullin Anna Panasenko Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence. 135-145 2019 LION https://doi.org/10.1007/978-3-030-38629-0_11 conf/lion/2019 db/conf/lion/lion2019.html#KelmanovKP19 Alexander Kel'manov Vladimir I. Khandeev The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension. 207-216 2019 MOTOR (2) https://doi.org/10.1007/978-3-030-33394-2_16 conf/motor/2019-2 db/conf/motor/motor2019-2.html#KelmanovK19 Anton V. Eremeev Alexander V. Kel'manov Mikhail Y. Kovalyov Artem V. Pyatkin Maximum Diversity Problem with Squared Euclidean Distance. 541-551 2019 MOTOR https://doi.org/10.1007/978-3-030-22629-9_38 conf/motor/2019 db/conf/motor/motor2019.html#EremeevKKP19 Alexander Kel'manov Sergey A. Khamidullin Anna Panasenko 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence. 386-393 2019 NUMTA (2) https://doi.org/10.1007/978-3-030-40616-5_34 conf/numta/2019-2 db/conf/numta/numta2019-2.html#KelmanovKP19 Alexander Kel'manov Vladimir I. Khandeev Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case. 394-399 2019 NUMTA (2) https://doi.org/10.1007/978-3-030-40616-5_35 conf/numta/2019-2 db/conf/numta/numta2019-2.html#KelmanovK19 Alexander Kel'manov Vladimir I. Khandeev Anna Panasenko Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset. 294-304 2018 AIST https://doi.org/10.1007/978-3-030-11027-7_28 conf/aist/2018 db/conf/aist/aist2018.html#KelmanovKP18 Alexander Kel'manov Ludmila Mikhailova Semyon Romanchenko On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences. 305-317 2018 AIST https://doi.org/10.1007/978-3-030-11027-7_29 conf/aist/2018 db/conf/aist/aist2018.html#KelmanovMR18 Alexander Kel'manov Sergey A. Khamidullin Vladimir I. Khandeev Artem V. Pyatkin Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence. 326-336 2018 LION https://doi.org/10.1007/978-3-030-05348-2_28 conf/lion/2018 db/conf/lion/lion2018.html#KelmanovKKP18
Alexander V. Kel'manov Sergey A. Khamidullin Vladimir I. Khandeev Exact pseudopolynomial algorithm for one sequence partitioning problem. 67-74 2017 78 Autom. Remote. Control. 1 https://doi.org/10.1134/S0005117917010052 db/journals/aarc/aarc78.html#KelmanovKK17
Anton V. Eremeev Alexander V. Kel'manov Artem V. Pyatkin Igor A. Ziegler On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. 142-151 2017 AIST https://doi.org/10.1007/978-3-319-73013-4_13 conf/aist/2017 db/conf/aist/aist2017.html#EremeevKPZ17 Alexander Kel'manov Sergey A. Khamidullin Vladimir I. Khandeev A Randomized Algorithm for 2-Partition of a Sequence. 313-322 2017 AIST https://doi.org/10.1007/978-3-319-73013-4_29 conf/aist/2017 db/conf/aist/aist2017.html#KelmanovKK17 Alexander Kel'manov Anna Motkova Vladimir Shenmaier An Approximation Scheme for a Weighted Two-Cluster Partition Problem. 323-333 2017 AIST https://doi.org/10.1007/978-3-319-73013-4_30 conf/aist/2017 db/conf/aist/aist2017.html#KelmanovMS17
Anton V. Eremeev Alexander Kelmanov Artem V. Pyatkin Igor A. Ziegler On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum. 2017 abs/1707.06068 CoRR http://arxiv.org/abs/1707.06068 db/journals/corr/corr1707.html#EremeevKPZ17
Anton V. Eremeev Alexander V. Kel'manov Artem V. Pyatkin On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction. 51-57 2016 AIST https://doi.org/10.1007/978-3-319-52920-2_5 conf/aist/2016 db/conf/aist/aist2016.html#EremeevKP16 Alexander Kel'manov Ludmila Mikhailova Sergey A. Khamidullin Vladimir I. Khandeev An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities. 171-181 2016 DOOR https://doi.org/10.1007/978-3-319-44914-2_14 conf/door/2016 db/conf/door/door2016.html#KelmanovMKK16 Alexander Kel'manov Anna Motkova A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem. 182-192 2016 DOOR https://doi.org/10.1007/978-3-319-44914-2_15 conf/door/2016 db/conf/door/door2016.html#KelmanovM16 Alexandr E. Galashov Alexander Kelmanov An Exact Pseudopolynomial Algorithm for a Problem of Finding a Family of Disjoint Subsets. 501-509 2016 DOOR (Supplement) https://ceur-ws.org/Vol-1623/papercpr2.pdf conf/door/2016s db/conf/door/door2016s.html#GalashovK16 Alexander Kelmanov Sergey A. Khamidullin Semyon Romanchenko Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence. 516-525 2016 DOOR (Supplement) https://ceur-ws.org/Vol-1623/papercpr4.pdf conf/door/2016s db/conf/door/door2016s.html#KelmanovKR16 Anton V. Eremeev Alexander Kelmanov Artem V. Pyatkin On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. 526-535 2016 DOOR (Supplement) https://ceur-ws.org/Vol-1623/papercpr5.pdf conf/door/2016s db/conf/door/door2016s.html#EremeevKP16
Alexandr E. Galashov Alexander V. Kel'manov A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets. 595-606 2014 75 Autom. Remote. Control. 4 https://doi.org/10.1134/S0005117914040018 db/journals/aarc/aarc75.html#GalashovK14
Alexander V. Kel'manov Byeungwoo Jeon A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. 645-656 2004 52 IEEE Trans. Signal Process. 3 https://doi.org/10.1109/TSP.2003.822285 db/journals/tsp/tsp52.html#KelmanovJ04
Anton V. Eremeev Alexandr E. Galashov Byeungwoo Jeon Sergey A. Khamidullin Vladimir I. Khandeev Mikhail Y. Kovalyov Ludmila Mikhailova Anna Motkova Anna Panasenko Artem V. Pyatkin Semyon Romanchenko Vladimir Shenmaier Igor A. Ziegler
  NODES
Idea 5
idea 5