Alexander V. Kel'manov
Orcid: 0000-0001-7757-7228Affiliations:
- Sobolev Institute of Mathematics, Novosibirsk, Russia
According to our database1,
Alexander V. Kel'manov
authored at least 24 papers
between 2004 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on math.nsc.ru
On csauthors.net:
Bibliography
2022
Ann. Math. Artif. Intell., 2022
2020
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence.
Ann. Math. Artif. Intell., 2020
2019
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
Proceedings of the Numerical Computations: Theory and Algorithms, 2019
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case.
Proceedings of the Numerical Computations: Theory and Algorithms, 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019
Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case.
Proceedings of the Analysis of Images, Social Networks and Texts, 2019
2018
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018
On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset.
Proceedings of the Analysis of Images, Social Networks and Texts, 2018
2017
Autom. Remote. Control., 2017
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017
2016
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities.
Proceedings of the Discrete Optimization and Operations Research, 2016
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem.
Proceedings of the Discrete Optimization and Operations Research, 2016
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
An Exact Pseudopolynomial Algorithm for a Problem of Finding a Family of Disjoint Subsets.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
On Complexity of Searching a Subset of Vectors with Shortest Average Under a Cardinality Restriction.
Proceedings of the Analysis of Images, Social Networks and Texts, 2016
2014
A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets.
Autom. Remote. Control., 2014
2004
A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train.
IEEE Trans. Signal Process., 2004