11 - 20 out of 46Page size: 10
Sort by: Title

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

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

  3. Easy NP-hardness Proofs of Some Subset Choice Problems

    Pyatkin, A. V., 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. 70-79 10 p. (Communications in Computer and Information Science; vol. 1275 CCIS).

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

  4. Efficient k -mer dataset compression using Eulerian covers of de Bruijn graphs and BWT

    Chen, H. Z. Q., Kitaev, S., Lang, X., Pyatkin, A. & Tang, R., 5 Dec 2025, In: RAIRO - Theoretical Informatics and Applications. 59, 18 p.

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

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

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

  7. Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop

    Chernykh, I. & Pyatkin, A., 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. 106-120 15 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

  8. Irreducible bin packing and normality in routing open shop

    Chernykh, I. & Pyatkin, A., Sept 2021, In: Annals of Mathematics and Artificial Intelligence. 89, 8-9, p. 899-918 20 p.

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

  9. Maximum diversity problem with squared euclidean distance

    Eremeev, A. V., Kel’manov, A. V., Kovalyov, M. Y. & Pyatkin, A. V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Proceedings. Khachay, M., Pardalos, P. & Kochetov, Y. (eds.). Springer, p. 541-551 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11548 LNCS).

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

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

Previous 1 2 3 4 5 Next

ID: 3437278