21 - 30 out of 39Page size: 10
  1. 2019

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 2018

  10. 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

  11. 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

  12. 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

Previous 1 2 3 4 Next

ID: 3431543