A. V. Kel’manov

807 total citations
55 papers, 315 citations indexed

About

A. V. Kel’manov is a scholar working on Artificial Intelligence, Industrial and Manufacturing Engineering and Computer Vision and Pattern Recognition. According to data from OpenAlex, A. V. Kel’manov has authored 55 papers receiving a total of 315 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 16 papers in Industrial and Manufacturing Engineering and 15 papers in Computer Vision and Pattern Recognition. Recurrent topics in A. V. Kel’manov's work include Optimization and Packing Problems (16 papers), Advanced Clustering Algorithms Research (16 papers) and Computational Geometry and Mesh Generation (11 papers). A. V. Kel’manov is often cited by papers focused on Optimization and Packing Problems (16 papers), Advanced Clustering Algorithms Research (16 papers) and Computational Geometry and Mesh Generation (11 papers). A. V. Kel’manov collaborates with scholars based in Russia, South Korea and Belarus. A. V. Kel’manov's co-authors include A. V. Pyatkin, Byeungwoo Jeon, È. Kh. Gimadi, Alexander Ageev, Anton V. Eremeev and Mikhail Y. Kovalyov and has published in prestigious journals such as IEEE Transactions on Signal Processing, Annals of Mathematics and Artificial Intelligence and Automation and Remote Control.

In The Last Decade

A. V. Kel’manov

47 papers receiving 312 citations

Peers

Countries citing papers authored by A. V. Kel’manov

Since Specialization

Citations

This map shows the geographic impact of A. V. Kel’manov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by A. V. Kel’manov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. V. Kel’manov more than expected).

Fields of papers citing papers by A. V. Kel’manov

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by A. V. Kel’manov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by A. V. Kel’manov. The network helps show where A. V. Kel’manov may publish in the future.

Co-authorship network of co-authors of A. V. Kel’manov

This figure shows the co-authorship network connecting the top 25 collaborators of A. V. Kel’manov. A scholar is included among the top collaborators of A. V. Kel’manov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with A. V. Kel’manov. A. V. Kel’manov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Selecting a subset of diverse points based on the squared euclidean distance 2021 ·Annals of Mathematics and Artificial Intelligence ·Anton V. Eremeev, A. V. Kel’manov, Mikhail Y. Kovalyov, A. V. Pyatkin	0
2	NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters 2019 ·Doklady Mathematics ·A. V. Kel’manov, A. V. Pyatkin, (unknown)	0
3	Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center 2018 ·Computational Mathematics and Mathematical Physics ·A. V. Kel’manov, (unknown)	1
4	Approximation algorithm for the problem of partitioning a sequence into clusters 2017 ·Computational Mathematics and Mathematical Physics ·A. V. Kel’manov, (unknown), (unknown), (unknown)	1
5	Exact pseudopolynomial algorithm for one sequence partitioning problem 2017 ·Automation and Remote Control ·A. V. Kel’manov, (unknown), (unknown)	1
6	Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence 2017 ·A. V. Kel’manov	1
7	On the complexity of some Euclidean optimal summing problems 2016 ·Doklady Mathematics ·Anton V. Eremeev, A. V. Kel’manov, A. V. Pyatkin	1
8	A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem 2016 ·Journal of Applied and Industrial Mathematics ·A. V. Kel’manov, (unknown), (unknown)	2
9	NP-hardness of some Quadratic Euclidean 2-clustering problems 2015 ·Doklady Mathematics ·A. V. Kel’manov, A. V. Pyatkin	6
10	Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph 2015 ·Proceedings of the Steklov Institute of Mathematics ·È. Kh. Gimadi, A. V. Kel’manov, A. V. Pyatkin, (unknown)	2
11	Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems 2012 ·Automation and Remote Control ·A. V. Kel’manov, (unknown)	9
12	An approximation algorithm for solving a problem of search for a vector subset 2012 ·Journal of Applied and Industrial Mathematics ·A. V. Kel’manov, (unknown)	13
13	Approximation algorithms for some intractable problems of choosing a vector subsequence 2012 ·Journal of Applied and Industrial Mathematics ·A. V. Kel’manov, (unknown), (unknown)	3
14	On the complexity of some cluster analysis problems 2011 ·Computational Mathematics and Mathematical Physics ·A. V. Kel’manov	7
15	On the complexity of some data analysis problems 2010 ·Computational Mathematics and Mathematical Physics ·A. V. Kel’manov	6
16	An algorithm for recognition of a vector alphabet generating a sequence with a quasi-periodic structure 2010 ·Pattern Recognition and Image Analysis ·A. V. Kel’manov, (unknown)	2
17	Complexity of certain problems of searching for subsets of vectors and cluster analysis 2009 ·Computational Mathematics and Mathematical Physics ·A. V. Kel’manov, A. V. Pyatkin	18
18	A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure 2009 ·Numerical Analysis and Applications ·A. V. Kel’manov, (unknown)	1
19	A posteriori detecting a quasiperiodic fragment in a numerical sequence 2008 ·Pattern Recognition and Image Analysis ·È. Kh. Gimadi, A. V. Kel’manov, (unknown), (unknown)	10
20	On the complexity of a search for a subset of “similar” vectors 2008 ·Doklady Mathematics ·A. V. Kel’manov, A. V. Pyatkin	18

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact