1. 2017
  2. Approximation algorithm for a quadratic euclidean problem of searching a subset with the largest cardinality

    Ageev, A. A., Kel'Manov, A. V., Pyatkin, A. V., Khamidullin, S. A. & Shenmaier, V. V., 1 Jan 2017, In: CEUR Workshop Proceedings. 1987, p. 19-23 5 p.

    Research output: Contribution to journalConference articlepeer-review

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

  4. On complexity of searching a subset of vectors with shortest average under a cardinality restriction

    Eremeev, A. V., Kel’Manov, A. V. & Pyatkin, A. V., 1 Jan 2017, Analysis of Images, Social Networks and Texts - 5th International Conference, AIST 2016, Revised Selected Papers. Ignatov, DI., Khachay, MY., Labunets, VG., Loukachevitch, N., Nikolenko, SI., Panchenko, A., Savchenko, AV. & Vorontsov, K. (eds.). Springer-Verlag GmbH and Co. KG, p. 51-57 7 p. (Communications in Computer and Information Science; vol. 661).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  5. On list incidentor (k, l)-coloring

    Vasil’eva, E. I. & Pyatkin, A. V., 1 Jan 2017, In: Journal of Applied and Industrial Mathematics. 11, 1, p. 125-129 5 p.

    Research output: Contribution to journalArticlepeer-review

  6. On some finite set clustering problems in euclidean space

    Kel'Manov, A. & Pyatkin, A., 1 Jan 2017, In: CEUR Workshop Proceedings. 1987, p. 310-315 6 p.

    Research output: Contribution to journalConference articlepeer-review

  7. Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

    Galashov, A. E. & Kel’manov, A. V., 1 Jan 2017, In: Numerical Analysis and Applications. 10, 1, p. 11-16 6 p.

    Research output: Contribution to journalArticlepeer-review

  8. Algorithms with performance guarantee for a weighted 2-partition problem

    Kel'Manov, A. & Motkova, A., 2017, In: CEUR Workshop Proceedings. 1987, p. 304-309 6 p.

    Research output: Contribution to journalArticlepeer-review

  9. 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 journalArticlepeer-review

  10. Conflict-free data aggregation on a square grid when transmission distance is not less than 3

    Erzin, A. & Plotnikov, R., 2017, Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, Vol. 10718 LNCS. p. 141-154 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10718 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  11. Efficient algorithm for the convergecast scheduling problem on a square grid with obstacles

    Erzin, A. I. & Plotnikov, R. V., 2017, In: CEUR Workshop Proceedings. 1987, p. 187-193 7 p.

    Research output: Contribution to journalArticlepeer-review

ID: 3086997