Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Kel'manov
Person information
- affiliation: Sobolev Institute of Mathematics, Novosibirsk, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]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. Ann. Math. Artif. Intell. 90(7-9): 965-977 (2022)- 2020
- [j4]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. Ann. Math. Artif. Intell. 88(1-3): 157-168 (2020)
2010 – 2019
- 2019
- [c19]Alexander Kel'manov, Vladimir I. Khandeev:
Fast and Exact Algorithms for Some NP-Hard 2-Clustering Problems in the One-Dimensional Case. AIST 2019: 377-387 - [c18]Alexander Kel'manov, Vladimir I. Khandeev:
On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line. LION 2019: 46-52 - [c17]Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko:
Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence. LION 2019: 135-145 - [c16]Alexander Kel'manov, Vladimir I. Khandeev:
The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension. MOTOR (2) 2019: 207-216 - [c15]Anton V. Eremeev, Alexander V. Kel'manov, Mikhail Y. Kovalyov, Artem V. Pyatkin:
Maximum Diversity Problem with Squared Euclidean Distance. MOTOR 2019: 541-551 - [c14]Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko:
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence. NUMTA (2) 2019: 386-393 - [c13]Alexander Kel'manov, Vladimir I. Khandeev:
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case. NUMTA (2) 2019: 394-399 - 2018
- [c12]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. AIST 2018: 294-304 - [c11]Alexander Kel'manov, Ludmila Mikhailova, Semyon Romanchenko:
On a Problem of Summing Elements Chosen from the Family of Finite Numerical Sequences. AIST 2018: 305-317 - [c10]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. LION 2018: 326-336 - 2017
- [j3]Alexander V. Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev:
Exact pseudopolynomial algorithm for one sequence partitioning problem. Autom. Remote. Control. 78(1): 67-74 (2017) - [c9]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. AIST 2017: 142-151 - [c8]Alexander Kel'manov, Sergey A. Khamidullin, Vladimir I. Khandeev:
A Randomized Algorithm for 2-Partition of a Sequence. AIST 2017: 313-322 - [c7]Alexander Kel'manov, Anna Motkova, Vladimir Shenmaier:
An Approximation Scheme for a Weighted Two-Cluster Partition Problem. AIST 2017: 323-333 - [i1]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. CoRR abs/1707.06068 (2017) - 2016
- [c6]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. AIST 2016: 51-57 - [c5]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. DOOR 2016: 171-181 - [c4]Alexander Kel'manov, Anna Motkova:
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem. DOOR 2016: 182-192 - [c3]Alexandr E. Galashov, Alexander Kelmanov:
An Exact Pseudopolynomial Algorithm for a Problem of Finding a Family of Disjoint Subsets. DOOR (Supplement) 2016: 501-509 - [c2]Alexander Kelmanov, Sergey A. Khamidullin, Semyon Romanchenko:
Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence. DOOR (Supplement) 2016: 516-525 - [c1]Anton V. Eremeev, Alexander Kelmanov, Artem V. Pyatkin:
On a Quadratic Euclidean Problem of Vector Subset Choice: Complexity and Algorithmic Approach. DOOR (Supplement) 2016: 526-535 - 2014
- [j2]Alexandr E. Galashov, Alexander V. Kel'manov:
A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets. Autom. Remote. Control. 75(4): 595-606 (2014)
2000 – 2009
- 2004
- [j1]Alexander V. Kel'manov, Byeungwoo Jeon:
A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. IEEE Trans. Signal Process. 52(3): 645-656 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-28 03:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
