A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train AV Kel'manov, B Jeon IEEE Transactions on Signal Processing 52 (3), 645-656, 2004 | 82 | 2004 |

Subsequences in a Quasi-periodic Sequence AV Kel'Manov, SA Khamidullin COMPUTATIONAL, MATHEMATICS AND MATHEMATICAL PHYSICS 4 (5), 2001 | 54 | 2001 |

A posteriori detecting a quasiperiodic fragment in a numerical sequence EK Gimadi, AV Kel’Manov, MA Kel’Manova, SA Khamidullin Pattern Recognition and Image Analysis 18, 30-42, 2008 | 47 | 2008 |

NP-completeness of some problems of choosing a vector subset AV Kel’Manov, AV Pyatkin Journal of Applied and Industrial Mathematics 5, 352-357, 2011 | 46 | 2011 |

An FPTAS for a vector subset search problem AV Kel’Manov, SM Romanchenko Journal of Applied and Industrial Mathematics 8, 329-336, 2014 | 45 | 2014 |

An approximation algorithm for solving a problem of search for a vector subset AV Kel’Manov, SM Romanchenko Journal of Applied and Industrial Mathematics 6, 90-96, 2012 | 44 | 2012 |

Complexity of certain problems of searching for subsets of vectors and cluster analysis AV Kel'manov, AV Pyatkin Computational Mathematics and Mathematical Physics 49 (11), 1966, 2009 | 43 | 2009 |

A randomized algorithm for two-cluster partition of a set of vectors AV Kel’manov, VI Khandeev Computational Mathematics and Mathematical Physics 55, 330-339, 2015 | 41 | 2015 |

On the complexity of a search for a subset of “similar” vectors AV Kel’Manov, AV Pyatkin Doklady Mathematics 78, 574-575, 2008 | 39 | 2008 |

An approximation algorithm for solving a problem of cluster analysis AV Dolgushev, AV Kel’manov Journal of Applied and Industrial Mathematics 5, 551-558, 2011 | 35 | 2011 |

On a version of the problem of choosing a vector subset AV Kel’Manov, AV Pyatkin Journal of Applied and Industrial Mathematics 3, 447-455, 2009 | 32 | 2009 |

A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence EK Gimadi, AV Kel'manov, MA Kelmanova, SA Khamidullin Sibirskii Zhurnal Industrial'noi Matematiki 9 (1), 55-74, 2006 | 32 | 2006 |

On complexity of some problems of cluster analysis of vector sequences AV Kel’manov, AV Pyatkin Journal of Applied and Industrial Mathematics 7, 363-369, 2013 | 31 | 2013 |

Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem AV Kel’manov, VI Khandeev Computational Mathematics and Mathematical Physics 56, 334-341, 2016 | 28 | 2016 |

NP-hardness of some quadratic Euclidean 2-clustering problems AV Kel’Manov, AV Pyatkin Doklady Mathematics 92, 634-637, 2015 | 27 | 2015 |

Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems AV Kel’manov, SM Romanchenko Automation and Remote Control 73, 349-354, 2012 | 27 | 2012 |

On the complexity of some quadratic Euclidean 2-clustering problems AV Kel’manov, AV Pyatkin Computational Mathematics and Mathematical Physics 56, 491-497, 2016 | 26 | 2016 |

A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem A Kel’manov, A Motkova Discrete Optimization and Operations Research: 9th International Conference …, 2016 | 24 | 2016 |

An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors AV Kel’manov, VI Khandeev Journal of Applied and Industrial Mathematics 9, 497-502, 2015 | 22 | 2015 |

A 2-approximation polynomial algorithm for a clustering problem AV Kel’manov, VI Khandeev Journal of Applied and Industrial Mathematics 7, 515-521, 2013 | 22 | 2013 |