1 - 10 out of 43Page size: 10
  1. 2016

  2. Completing partial schedules for open shop with unit processing times and routing

    Van Bevern, R. & Pyatkin, A. V., 1 Jan 2016, Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings. Woeginger, G. J. & Kulikov, A. S. (eds.). Springer, p. 73-87 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9691).

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

  3. 2017

  4. 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 journal › Conference article › peer-review

  5. 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, p. 51-57 7 p. (Communications in Computer and Information Science; vol. 661).

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

  6. 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 journal › Article › peer-review

  7. 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 journal › Conference article › peer-review

  8. Approximation polynomial algorithm for the data editing and data cleaning problem

    Ageeva, A. A., Kel’manov, A. V., Pyatkin, A. V., Khamidullin, S. A. & Shenmaier, V. V., 1 Jul 2017, In: Pattern Recognition and Image Analysis. 27, 3, p. 365-370 6 p.

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

  9. NP-Hardness of balanced minimum sum-of-squares clustering

    Pyatkin, A., Aloise, D. & Mladenović, N., 1 Oct 2017, In: Pattern Recognition Letters. 97, p. 44-45 2 p.

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

  10. On (1,l)-coloring of incidentors of multigraphs

    Golovachev, M. O. & Pyatkin, A. V., 1 Oct 2017, In: Journal of Applied and Industrial Mathematics. 11, 4, p. 514-520 7 p.

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

  11. 1/2-Approximation polynomial-time algorithm for a problem of searching a subset

    Ageev, A., Kel'Manov, A., Pyatkin, A., Khamidullin, S. & Shenmaier, 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. 8-12 5 p. 8109827

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

  12. 2018

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

ID: 3437278