1 - 20 out of 43Page size: 20
  1. 2024

  2. On semi-transitive orientability of split graphs

    Kitaev, S. & Pyatkin, A., Feb 2024, In: Information Processing Letters. 184, 4 p., 106435.

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

  3. 2023

  4. 1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation

    Pyatkin, A. V., 2023, In: Yugoslav Journal of Operations Research. 33, 1, p. 59-69 11 p.

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

  5. 2022

  6. On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges

    Pyatkin, A. V. & Chernykh, O. I., Feb 2022, In: Journal of Applied and Industrial Mathematics. 16, 1, p. 116-121 6 p.

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

  7. 2021

  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. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes

    Pyatkin, A. V., 2021, Mathematical Optimization Theory and Operations Research: Recent Trends - 20th International Conference, MOTOR 2021, Revised Selected Papers. Strekalovsky, A., Kochetov, Y., Gruzdeva, T. & Orlov, A. (eds.). Springer, p. 248-256 9 p. (Communications in Computer and Information Science; vol. 1476 CCIS).

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

  10. On Semi-Transitive Orientability of Triangle-Free Graphs

    Kitaev, S. & Pyatkin, A., 2021, In: Discussiones Mathematicae - Graph Theory.

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

  11. 2020

  12. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times

    Golovachev, M. O. & Pyatkin, A. V., 1 Aug 2020, In: Journal of Applied and Industrial Mathematics. 14, 3, p. 470-479 10 p.

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

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

  14. On finding minimum cardinality subset of vectors with a constraint on the sum of squared euclidean pairwise distances

    Eremeev, A. V., Kovalyov, M. Y. & Pyatkin, A. V., 1 Jul 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer Gabler, p. 40-45 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

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

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

  17. Preface

    Kononov, A., Strekalovsky, A., Posypkin, M. & Pyatkin, A., 1 Mar 2020, In: Journal of Global Optimization. 76, 3, p. 453-454 2 p.

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

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

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

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

  21. 2019

  22. The maximum number of induced open triangles in graphs of a given order

    Pyatkin, A., Lykhovyd, E. & Butenko, S., 1 Nov 2019, In: Optimization Letters. 13, 8, p. 1927-1935 9 p.

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

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

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

  25. On a list (k, l)-coloring of incidentors in multigraphs of even degree for some values of k and l

    Pyatkin, A. V. E., 20 May 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 2, p. 177-184 8 p.

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

  26. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times

    van Bevern, R. A., Pyatkin, A. V. & Sevastyanov, S., 1 Jan 2019, In: Сибирские электронные математические известия. 16, p. 42-84 43 p.

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

Previous 1 2 3 Next

ID: 3437278