Science activity

Articles (56) More info

1	Kitaev S. , Pyatkin A.V. A note on Hameed's conjecture on the semi-transitivity of Mycielski graphs Discussiones Mathematicae - Graph Theory. 2025. DOI: 10.7151/dmgt.2575 WOS РИНЦ OpenAlex
2	Pyatkin A.V. On the Complexity of the Problem of Choice of Large Clusters Journal of Applied and Industrial Mathematics. 2024. V.18. N2. P.312-315. DOI: 10.1134/S1990478924020121 Scopus РИНЦ OpenAlex
3	Pyatkin A.V. On the Maximum Number of Open Triangles in Graphs with Few Edges Journal of Applied and Industrial Mathematics. 2024. V.18. N3. P.516-520. DOI: 10.1134/S1990478924030128 Scopus РИНЦ OpenAlex
4	Kitaev S. , Pyatkin A. On semi-transitive orientability of split graphs Information Processing Letters. 2024. V.184. 106435 :1-4. DOI: 10.1016/j.ipl.2023.106435 WOS Scopus РИНЦ OpenAlex
5	Huang S. , Kitaev S. , Pyatkin A.V. An embedding technique in the study of word-representability of graphs Discrete Applied Mathematics. 2024. V.346. P.170-182. DOI: 10.1016/j.dam.2023.12.017 WOS Scopus РИНЦ OpenAlex
6	Kitaev S. , Futorny M. , Pyatkin A. New Tools to Study 1-11-Representation of Graphs Graphs and Combinatorics. 2024. V.40. N5. P.1-13. DOI: 10.1007/s00373-024-02825-1 WOS Scopus РИНЦ OpenAlex
7	Kitaev S. , Pyatkin A.V. On semi-transitive orientability of triangle-free graphs Discussiones Mathematicae - Graph Theory. 2023. V.43. N2. P.533-547. DOI: 10.7151/dmgt.2384 WOS Scopus РИНЦ OpenAlex
8	Pyatkin A.V. 1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation Yugoslav Journal of Operations Research. 2023. V.33. N1. P.59-69. DOI: 10.2298/yjor211018008p Scopus РИНЦ OpenAlex
9	Kitaev S. , Pyatkin A. On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs Electronic Journal of Combinatorics. 2023. V.30. N1. #P1.27 :1-21. DOI: 10.37236/11199 WOS Scopus РИНЦ OpenAlex
10	Pyatkin A.V. PTAS for p-Means q-Medoids r-Given Clustering Problem In compilation Mathematical Optimization Theory and Operations Research 22nd International Conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023, Proceedings. – Springer Cham., 2023. – Т.13930. – C.133-141. – ISBN 9783031353055. DOI: 10.1007/978-3-031-35305-5_9 Scopus OpenAlex
11	Foss S. , Konstantopoulos T. , Pyatkin A. Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph Annals of Applied Probability. 2023. V.33. N2. P.731-753. DOI: 10.1214/22-aap1832 WOS Scopus РИНЦ OpenAlex
12	Pyatkin A.V. PTAS for Problems of Vector Choice and Clustering with Various Centers Journal of Applied and Industrial Mathematics. 2023. V.17. N3. P.600-607. DOI: 10.1134/S1990478923030134 Scopus РИНЦ OpenAlex
13	Eremeev A.V. , Kel’manov A.V. , Kovalyov M.Y. , Pyatkin A.V. Selecting a subset of diverse points based on the squared euclidean distance Annals of Mathematics and Artificial Intelligence. 2022. V.90. N7-9. P.965-977. DOI: 10.1007/s10472-021-09773-z WOS Scopus РИНЦ OpenAlex
14	Chernykh I. , Pyatkin A. On complexity of two-machine routing propotionate open shop Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2022. V.19. N2. P.528-539. DOI: 10.33048/semi.2022.19.044 WOS РИНЦ
15	Pyatkin A.V. , Chernykh O.I. On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges Journal of Applied and Industrial Mathematics. 2022. V.16. N1. P.116-121. DOI: 10.1134/S1990478922010112 Scopus РИНЦ OpenAlex
16	Chernykh I. , Pyatkin A. Irreducible bin packing and normality in routing open shop Annals of Mathematics and Artificial Intelligence. 2021. V.89. N8-9. P.899-918. DOI: 10.1007/s10472-021-09759-x WOS Scopus OpenAlex
17	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Size of the Clusters: Complexity and Approximability Proceedings of the Steklov Institute of Mathematics. 2021. V.313. NS1. P.S117-S124. DOI: 10.1134/s0081543821030123 WOS Scopus OpenAlex
18	Pyatkin A.V. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes Communications in Computer and Information Science. 2021. P.248-256. DOI: 10.1007/978-3-030-86433-0_17 Scopus OpenAlex
19	Chernykh I. , Pyatkin A. Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop Lecture Notes in Computer Science. 2020. P.106-120. DOI: 10.1007/978-3-030-38629-0_9 Scopus OpenAlex
20	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. On the Complexity of SomeMax–Min Clustering Problems Proceedings of the Steklov Institute of Mathematics. 2020. V.309. NS1. P.S65-S73. DOI: 10.1134/s0081543820040082 WOS Scopus OpenAlex
21	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. NP-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes Doklady Mathematics. 2020. V.100. N3. P.545-548. DOI: 10.1134/s1064562419060127 WOS Scopus OpenAlex
22	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters Computational Mathematics and Mathematical Physics. 2020. V.60. N1. P.163-170. DOI: 10.1134/s096554251911006x WOS Scopus OpenAlex
23	Eremeev A.V. , Kovalyov M.Y. , Pyatkin A.V. On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances Lecture Notes in Computer Science. 2020. P.40-45. DOI: 10.1007/978-3-030-53552-0_6 Scopus OpenAlex
24	Kel’manov A. , Khandeev V. , Pyatkin A. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters Communications in Computer and Information Science. 2020. P.127-136. DOI: 10.1007/978-3-030-38603-0_10 Scopus OpenAlex
25	Kononov A. , Strekalovsky A. , Posypkin M. , Pyatkin A. Preface Journal of Global Optimization. 2020. V.76. N3. P.453-454. DOI: 10.1007/s10898-020-00887-y WOS Scopus OpenAlex
26	Golovachev M.O. , Pyatkin A.V. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times Journal of Applied and Industrial Mathematics. 2020. V.14. N3. P.470-479. DOI: 10.1134/s1990478920030060 Scopus OpenAlex
27	Pyatkin A.V. Easy NP-hardness Proofs of Some Subset Choice Problems Communications in Computer and Information Science. 2020. P.70-79. DOI: 10.1007/978-3-030-58657-7_8 Scopus OpenAlex
28	Bevern R.A.v. , Pyatkin A.V. , Sevastyanov S.V. An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.42-84. DOI: 10.33048/semi.2019.16.003 WOS Scopus OpenAlex
29	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters Doklady Mathematics. 2019. V.99. N1. P.52-56. DOI: 10.1134/s1064562419010162 WOS Scopus OpenAlex
30	Kel’manov A. , Khamidullin S. , Khandeev V. , Pyatkin A. An Exact Algorithm of Searching for the Largest Size Cluster in an Integer Sequence 2-Clustering Problem Communications in Computer and Information Science. 2019. P.131-143. DOI: 10.1007/978-3-030-10934-9_10 Scopus OpenAlex
31	Cheon G-S. , Kim J. , Kim M. , Kitaev S. , Pyatkin A. On $k\textrm{-}11$-representable graphs Journal of Combinatorics. 2019. V.10. N3. P.491-513. DOI: 10.4310/joc.2019.v10.n3.a3 WOS OpenAlex
32	Golovachev M. , Pyatkin A.V. Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines Lecture Notes in Computer Science. 2019. P.264-276. DOI: 10.1007/978-3-030-22629-9_19 Scopus OpenAlex
33	Eremeev A.V. , Kel’manov A.V. , Kovalyov M.Y. , Pyatkin A.V. Maximum Diversity Problem with Squared Euclidean Distance Lecture Notes in Computer Science. 2019. P.541-551. DOI: 10.1007/978-3-030-22629-9_38 Scopus OpenAlex
34	Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I. NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters Doklady Mathematics. 2019. V.100. N2. P.416-419. DOI: 10.1134/s1064562419050028 WOS Scopus OpenAlex
35	Kel’manov A. , Khandeev V. , Pyatkin A. NP-hardness of Some Max-Min Clustering Problems Communications in Computer and Information Science. 2019. P.144-154. DOI: 10.1007/978-3-030-10934-9_11 Scopus OpenAlex
36	Kel’manov A. , Khamidullin S. , Khandeev V. , Pyatkin A. Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence Annals of Mathematics and Artificial Intelligence. 2019. V.88. N1-3. P.157-168. DOI: 10.1007/s10472-019-09623-z WOS Scopus OpenAlex
37	Glen M. , Kitaev S. , Pyatkin A. On the representation number of a crown graph Discrete Applied Mathematics. 2018. V.244. P.89-93. DOI: 10.1016/j.dam.2018.03.013 WOS Scopus OpenAlex
38	Kel’manov A.V. , Khamidullin S.A. , Khandeev V.I. , Pyatkin A.V. , Shamardin Y.V. , Shenmaier V.V. A Polynomial-Time Approximation Algorithm for One Problem Simulating the Search in a Time Series for the Largest Subsequence of Similar Elements Pattern Recognition and Image Analysis. 2018. V.28. N3. P.363-370. DOI: 10.1134/s1054661818030094 Scopus OpenAlex
39	Kel’manov A.V. , Pyatkin A.V. NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points Computational Mathematics and Mathematical Physics. 2018. V.58. N5. P.822-826. DOI: 10.1134/s0965542518050123 WOS Scopus OpenAlex
40	Kitaev S.V. , Pyatkin A.V. Word-Representable Graphs: a Survey Journal of Applied and Industrial Mathematics. 2018. V.12. N2. P.278-296. DOI: 10.1134/s1990478918020084 Scopus OpenAlex
41	Kel’manov A. , Pyatkin A. , Khamidullin S. , Khandeev V. , Shamardin Y.V. , Shenmaier V. An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space Communications in Computer and Information Science. 2018. P.120-130. DOI: 10.1007/978-3-319-93800-4_10 Scopus OpenAlex
42	Kel’manov A.V. , Khamidullin S.A. , Khandeev V.I. , Pyatkin A.V. An Exact Algorithm of Searching for the Largest Cluster in an Integer-Valued Problem of 2-Partitioning a Sequence Pattern Recognition and Image Analysis. 2018. V.28. N4. P.703-711. DOI: 10.1134/s105466181804017x Scopus OpenAlex
43	Kel’manov A. , Khamidullin S. , Khandeev V. , Pyatkin A. Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence Lecture Notes in Computer Science. 2018. P.326-336. DOI: 10.1007/978-3-030-05348-2_28 Scopus OpenAlex
44	Pyatkin A. , Lykhovyd E. , Butenko S. The maximum number of induced open triangles in graphs of a given order Optimization Letters. 2018. V.13. N8. P.1927-1935. DOI: 10.1007/s11590-018-1330-2 WOS Scopus OpenAlex
45	Chernykh I. , Pyatkin A. Refinement of the Optima Localization for the Two-Machine Routing Open Shop CEUR Workshop Proceedings. 2017. V.1987. P.131-138. Scopus
46	Eremeev A.V. , Kelmanov A. , Pyatkin A.V. On Complexity of Searching a Subset of Vectors with Shortest Average under a Cardinality Restriction Communications in Computer and Information Science. 2017. V.661. P.51-57. DOI: 10.1007/978-3-319-52920-2_5 Scopus OpenAlex
47	Eremeev A.V. , Kelmanov A.V. , Pyatkin A.V. , Ziegler I.A. On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum Lecture Notes in Computer Science. 2017. P.142-151. DOI: 10.1007/978-3-319-73013-4_13 Scopus OpenAlex
48	Vasil’eva E.I. , Pyatkin A.V. On list incidentor (k, l)-coloring Journal of Applied and Industrial Mathematics. 2017. V.11. N1. P.125-129. DOI: 10.1134/s1990478917010148 Scopus OpenAlex
49	Pyatkin A. , Aloise D. , Mladenović N. NP-Hardness of balanced minimum sum-of-squares clustering Pattern Recognition Letters. 2017. V.97. P.44-45. DOI: 10.1016/j.patrec.2017.05.033 WOS Scopus OpenAlex
50	Ageev A. , Kel'manov A. , Pyatkin A. , Khamidullin S. , Shenmaier V. 1/2-Approximation polynomial-time algorithm for a problem of searching a subset In compilation 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.8-12. DOI: 10.1109/sibircon.2017.8109827 WOS Scopus OpenAlex

Conference attendances (17) More info

1	Pyatkin A.V. Asymptotically optimal construction of graphs with maximum number of open triangles and small number of edges XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024
2	Pyatkin A.V. Incidentor coloring and local networks Future Network Frontier Workshop 14-15 Sep 2023
3	Pyatkin A.V. PTAS for p-means q-medoids r-given clustering problem 22nd International conference "Mathematical Optimization Theory and Operations Research" 02-08 Jul 2023
4	Pyatkin A. , Chernykh I. On complexity of two-machine routing propotionate open shop International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022 02-08 Jul 2022
5	Chernykh I. , Pyatkin A. 2-Summing problem and NP-hardness of proportionate routing open shop ECCO XXXV - CO 2022 Joint Conference 09-11 Jun 2022
6	Pyatkin A.V. On complexity of quadratic 2-clustering 1-Mean and 1-Medoid problem with arbitrary clusters sizes Mathematical optimization theory and operations research (MOTOR-2021) 05-10 Jul 2021
7	Pyatkin A.V. , Khandeev V.I. , Kelmanov A. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters International Conference on Optimization and Applications 30 Sep - 4 Oct 2019
8	Pyatkin A.V. , Eremeev A.V. , Kelmanov A. , Kovalev M. Maximum diversity problem with squared euclidean distance 18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019
9	Pyatkin A.V. , Golovachev M. Routing open shop with two nodes, unit processing times and equal number of jobs and machines 18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019
10	Pyatkin A.V. , Chernykh I.D. Irreducible bin packing: complexity, solvability and application to the routing open shop 13th LION Learning and Intelligent OptimizatioN Conference, May 27-31, 2019. Chania, Crete, Greece 27-31 May 2019
11	Pyatkin A.V. , Chernykh I.D. When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019
12	Chernykh I. , Pyatkin A. When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019
13	Pyatkin A.V. , Vasilyeva Е.I. ON LIST INCIDENTOR (k, l)-COLORING OF MULTIGRAPHS OF EVEN DEGREE IN THE CASE OF LARGE l Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 Jul 2018
14	Pyatkin A.V. , Chernykh I.D. Irreducible bin packing and its applications to the routing open shop problem Проблемы оптимизации и их приложения Optimization Problems and Their Applications 08-14 Jul 2018
15	Pyatkin A.V. , Chernykh I.D. Refinement of the Optima Localization for the Two-Machine Routing Open Shop. 8 Int. conf. Optimization and Applications 02-06 Oct 2017
16	Pyatkin A.V. , Golovachev M. On (1, l)-coloring of incidentors of some classes of graphs XVII Байкальская международная школа-семинар 'Методы Оптимизации и их Приложения' 31 Jul - 6 Aug 2017
17	Chernykh I. , Lgotina E. , Pyatkin A. On the optima localization in two-machine routing open shops Workshop on Models and Algorithms for Planning and Scheduling Problems 12-16 Jun 2017

Identifiers

Degrees

2009 - Dr.Sc.

Academic titles

2007 - Associate professor