1 - 39 out of 39Page size: 100
  1. 2024

  2. Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets

    Khandeev, V. & Neshchadim, S., 20 Dec 2024, Communications in Computer and Information Science. Springer, p. 319-333 15 p. 22. (Communications in Computer and Information Science; vol. 2239 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  3. Fast approximation algorithms for some maximin clustering problems

    Khandeev, V. & Neshchadim, S., 2024, In: Yugoslav Journal of Operations Research. 34, 2, p. 337-353 17 p., 7.

    Research output: Contribution to journal › Article › peer-review

  4. 2023

  5. Constant-Factor Approximation Algorithms for Some Maximin Multi-clustering Problems

    Khandeev, V. & Neshchadim, S., 2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, p. 85-100 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13930 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  6. 2022

  7. Approximate Algorithms for Some Maximin Clustering Problems

    Khandeev, V. & Neshchadim, S., 2022, Mathematical Optimization Theory and Operations Research: Recent Trends - 21st International Conference, MOTOR 2022, Revised Selected Papers. Kochetov, Y., Eremeev, A., Khamisov, O. & Rettieva, A. (eds.). Springer, p. 89-103 15 p. (Communications in Computer and Information Science; vol. 1661 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  8. 2021

  9. Max-Min Problems of Searching for Two Disjoint Subsets

    Khandeev, V. & Neshchadim, S., 2021, Optimization and Applications - 12th International Conference, OPTIMA 2021, Proceedings. Olenev, N. N., Evtushenko, Y. G., Jaćimović, M., Khachay, M. & Malkova, V. (eds.). Springer, p. 231-245 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13078 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. 2020

  11. On the Complexity of SomeMax-Min Clustering Problems

    Kel'manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Aug 2020, In: Proceedings of the Steklov Institute of Mathematics. 309, SUPPL 1, p. S65-S73 9 p.

    Research output: Contribution to journal › Article › peer-review

  12. Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem

    Khandeev, V. & Panasenko, A., Jul 2020, Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Revised Selected Papers. Kochetov, Y., Bykadorov, I. & Gruzdeva, T. (eds.). Springer, p. 30-35 6 p. (Communications in Computer and Information Science; vol. 1275 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  13. Randomized algorithms for some sequence clustering problems

    Khamidullin, S., Khandeev, V. & Panasenko, A., 1 Jun 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer Gabler, p. 96-101 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12096 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  14. Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Mar 2020, In: Annals of Mathematics and Artificial Intelligence. 88, 1-3, p. 157-168 12 p.

    Research output: Contribution to journal › Article › peer-review

  15. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

    Kel’manov, A. & Khandeev, V., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 46-52 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  16. Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case

    Kel’manov, A. & Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 394-399 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  17. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 127-136 10 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  18. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation

    Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 400-405 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  19. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Jan 2020, In: Computational Mathematics and Mathematical Physics. 60, 1, p. 163-170 8 p.

    Research output: Contribution to journal › Article › peer-review

  20. 2019

  21. NP-hardness of quadratic euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Nov 2019, In: Doklady Mathematics. 100, 3, p. 545-548 4 p.

    Research output: Contribution to journal › Article › peer-review

  22. NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., 1 Sept 2019, In: Doklady Mathematics. 100, 2, p. 416-419 4 p.

    Research output: Contribution to journal › Article › peer-review

  23. Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem

    Kel’manov, A. V. & Khandeev, V. I., 1 Sept 2019, In: Computational Mathematics and Mathematical Physics. 59, 9, p. 1553-1561 9 p.

    Research output: Contribution to journal › Article › peer-review

  24. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

    Kel’manov, A. V. & Khandeev, V. I., 1 Jul 2019, In: Doklady Mathematics. 100, 1, p. 339-342 4 p.

    Research output: Contribution to journal › Article › peer-review

  25. Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space

    Kel’manov, A. V., Panasenko, A. V. & Khandeev, V. I., 1 May 2019, In: Computational Mathematics and Mathematical Physics. 59, 5, p. 842-850 9 p.

    Research output: Contribution to journal › Article › peer-review

  26. Exact Algorithms of Search for a Cluster of the Largest Size in Two Integer 2-Clustering Problems

    Kel′manov, A. V., Panasenko, A. V. & Khandeev, V. I., 1 Apr 2019, In: Numerical Analysis and Applications. 12, 2, p. 105-115 11 p.

    Research output: Contribution to journal › Article › peer-review

  27. An Exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 131-143 13 p. (Communications in Computer and Information Science; vol. 974).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  28. Exact algorithms for two quadratic euclidean problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Learning and Intelligent Optimization - 12th International Conference, LION 12, Revised Selected Papers. Springer, p. 326-336 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11353 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  29. Fast and exact algorithms for some NP-hard 2-clustering problems in the one-dimensional case

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Analysis of Images, Social Networks and Texts - 8th International Conference, AIST 2019, Revised Selected Papers. van der Aalst, W. M. P., Batagelj, V., Ignatov, D. I., Kuskova, V., Kuznetsov, S. O., Lomazova, I. A., Khachay, M., Kutuzov, A., Loukachevitch, N., Napoli, A., Pardalos, P. M., Pelillo, M., Savchenko, A. V. & Tutubalina, E. (eds.). Springer International Publishing AG, p. 377-387 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11832 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  30. NP-hardness of some max-min clustering problems

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 144-154 11 p. (Communications in Computer and Information Science; vol. 974).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  31. On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., 1 Jan 2019, In: Doklady Mathematics. 99, 1, p. 52-56 5 p.

    Research output: Contribution to journal › Article › peer-review

  32. Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with constraints on the size of the clusters: Complexity and approximability

    Kel'manov, A. V. E., Pyatkin, A. V. E. & Khandeev, V. I. I., 1 Jan 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 4, p. 69-78 10 p.

    Research output: Contribution to journal › Article › peer-review

  33. The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Bykadorov, I., Strusevich, V. & Tchemisova, T. (eds.). Springer International Publishing AG, p. 207-216 10 p. (Communications in Computer and Information Science; vol. 1090 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  34. 2018

  35. An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence

    Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I. & Pyatkin, A. V., 1 Oct 2018, In: Pattern Recognition and Image Analysis. 28, 4, p. 703-711 9 p.

    Research output: Contribution to journal › Article › peer-review

  36. A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements

    Kel’manov, A. V., Khamidullin, S. A., Khandeev, V. I., Pyatkin, A. V., Shamardin, Y. V. & Shenmaier, V. V., 1 Jul 2018, In: Pattern Recognition and Image Analysis. 28, 3, p. 363-370 8 p.

    Research output: Contribution to journal › Article › peer-review

  37. An approximation polynomial algorithm for a problem of searching for the longest subsequence in a finite sequence of points in euclidean space

    Kel’manov, A., Pyatkin, A., Khamidullin, S., Khandeev, V., Shamardin, Y. V. & Shenmaier, V., 1 Jan 2018, Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer, p. 120-130 11 p. (Communications in Computer and Information Science; vol. 871).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  38. A randomized algorithm for 2-partition of a sequence

    Kel’manov, A., Khamidullin, S. & Khandeev, V., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. VanDerAalst, WMP., Ignatov, DI., Khachay, M., Kuznetsov, SO., Lempitsky, Lomazova, IA., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, PM., Savchenko, AV. & Wasserman, S. (eds.). Springer, p. 313-322 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10716 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  39. A Randomized Algorithm for a Sequence 2-Clustering Problem

    Kel'manov, A. V., Khamidullin, S. A. & Khandeev, V. I., 1 Jan 2018, In: Computational Mathematics and Mathematical Physics. 58, 12, p. 2078-2085 8 p.

    Research output: Contribution to journal › Article › peer-review

  40. Exact algorithms for the special cases of two hard to solve problems of searching for the largest subset

    Kel’manov, A., Khandeev, V. & Panasenko, A., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers. Panchenko, A., van der Aalst, W. M., Khachay, M., Pardalos, P. M., Batagelj, V., Loukachevitch, N., Glavaš, G., Ignatov, D. I., Kuznetsov, S. O., Koltsova, O., Lomazova, I. A., Savchenko, A. V., Napoli, A. & Pelillo, M. (eds.). Springer, p. 294-304 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11179 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  41. Randomized algorithms for some clustering problems

    Kel’manov, A., Khandeev, V. & Panasenko, A., 1 Jan 2018, Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer, p. 109-119 11 p. (Communications in Computer and Information Science; vol. 871).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  42. 2017

  43. An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Constraints on Their Cardinalities

    Kel’manov, A. V., Mikhailova, L. V., Khamidullin, S. A. & Khandeev, V. I., 1 Dec 2017, In: Proceedings of the Steklov Institute of Mathematics. 299, p. 88-96 9 p.

    Research output: Contribution to journal › Article › peer-review

  44. Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster

    Kel'Manov, A. & Khandeev, V., 14 Nov 2017, Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., p. 91-93 3 p. 8109844

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  45. Approximation algorithm for the problem of partitioning a sequence into clusters

    Kel’manov, A. V., Mikhailova, L. V., Khamidullin, S. A. & Khandeev, V. I., 1 Aug 2017, In: Computational Mathematics and Mathematical Physics. 57, 8, p. 1376-1383 8 p.

    Research output: Contribution to journal › Article › peer-review

  46. Exact pseudopolynomial algorithm for one sequence partitioning problem

    Kel’manov, A. V., Khamidullin, S. A. & Khandeev, V. I., 1 Jan 2017, In: Automation and Remote Control. 78, 1, p. 67-74 8 p.

    Research output: Contribution to journal › Article › peer-review

  47. Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence

    Kel'Manov, A. & Khandeev, V., 2017, In: CEUR Workshop Proceedings. 1987, p. 298-303 6 p.

    Research output: Contribution to journal › Article › peer-review

ID: 3431543