|
41
|
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
|
|
42
|
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
|
|
43
|
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
|
|
44
|
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
|
|
45
|
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
|
|
46
|
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
|
|
47
|
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
|
|
48
|
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
|
|
49
|
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
|
|
50
|
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
|
|
51
|
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
|
|
52
|
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
|
|
53
|
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
|
|
54
|
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
|
|
55
|
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
|
|
56
|
Golovachev M.O.
, Pyatkin A.V.
On (1,l)-coloring of incidentors of multigraphs
Journal of Applied and Industrial Mathematics. 2017.
V.11. N4. P.514-520. DOI: 10.1134/s1990478917040081
Scopus
OpenAlex
|
|
57
|
Ageev A.A.
, Kel’manov A.V.
, Pyatkin A.V.
, Khamidullin S.A.
, Shenmaier V.V.
Approximation polynomial algorithm for the data editing and data cleaning problem
Pattern Recognition and Image Analysis. 2017.
V.27. N3. P.365-370. DOI: 10.1134/s1054661817030038
Scopus
OpenAlex
|
|
58
|
Ageev A.
, Kel'manov A.
, Pyatkin A.
, Khamidullin S.
, Shenmaier V.
1/2-Approximation polynomial-time algorithm for a problem of searching a subset
В сборнике
2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON).
2017.
– C.8-12. DOI: 10.1109/sibircon.2017.8109827
WOS
Scopus
OpenAlex
|
|
59
|
Ageev A.A.
, Kelmanov A.V.
, Khamidullin S.A.
, Pyatkin A.
, Shenmaier V.V.
Approximation Algorithm for a Quadratic Euclidean Problem of Searching a Subset with the Largest Cardinality
CEUR Workshop Proceedings. 2017.
V.1987. P.19-23.
Scopus
|
|
60
|
Ageev A.A.
, Kel’manov A.V.
, Pyatkin A.V.
Complexity of the weighted max-cut in Euclidean space
Journal of Applied and Industrial Mathematics. 2014.
V.8. N4. P.453-457. DOI: 10.1134/s1990478914040012
Scopus
OpenAlex
|