1 - 43 out of 43Page size: 100
  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

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

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

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

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

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

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

  33. Routing open shop with two nodes, unit processing times and equal number of jobs and machines

    Golovachev, M. & 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. 264-276 13 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

  34. 2018

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

  36. On the representation number of a crown graph

    Glen, M., Kitaev, S. & Pyatkin, A., 31 Jul 2018, In: Discrete Applied Mathematics. 244, p. 89-93 5 p.

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

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

  38. NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points

    Kel’manov, A. V. & Pyatkin, A. V., 1 May 2018, In: Computational Mathematics and Mathematical Physics. 58, 5, p. 822-826 5 p.

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

  39. Word-Representable Graphs: a Survey

    Kitaev, S. V. & Pyatkin, A. V., 1 Apr 2018, In: Journal of Applied and Industrial Mathematics. 12, 2, p. 278-296 19 p.

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

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

  41. On finding maximum cardinality subset of vectors with a constraint on normalized squared length of vectors sum

    Eremeev, A. V., Kelmanov, A. V., Pyatkin, A. V. & Ziegler, I. A., 1 Jan 2018, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). VanDerAalst, WMP., Ignatov, DI., Khachay, M., Kuznetsov, SO., Lempitsky, Lomazova, IA., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, PM., Savchenko, AV. & Wasserman, S. (eds.). Springer, p. 142-151 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10716 LNCS).

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

  42. 2017

  43. 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. (Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017).

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

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

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

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

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

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

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

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

  51. 2016

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

ID: 3437278