Статьи - Sciact

Статьи (66)

#	Публикация
21	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
22	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 РИНЦ
23	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
24	Pyatkin A.V. , Chernykh O.I. О максимальном числе открытых треугольников в графах с одинаковым числом вершин и рёбер Дискретный анализ и исследование операций. 2022. Т.29. №1. С.46-55. DOI: 10.33048/daio.2022.29.723 РИНЦ OpenAlex
25	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
26	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
27	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
28	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
29	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
30	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
31	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
32	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
33	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
34	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
35	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
36	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
37	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
38	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
39	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
40	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

2 / 4 - Всего 66 записей

Фильтр

Название

Год

DOI

Реферат

Ключевые слова

Жанр

Оригинальность

Журнал

Язык

Автор

Open access

Сортировка

Столбцы

Записей на страницу

Сбросить