Sciact
Toggle navigation
  • EN
  • RU

Sections:

  • Articles
  • Books
  • Conference attendances
  • Conference theses
  • Patents

Articles (70)

# Публикация
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 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
43 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
44 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
45 Пяткин А.В.
О предписанной (k, l)-раскраске инциденторов мультиграфов четной степени при некоторых значениях k и l
Труды Института математики и механики УрО РАН (Trudy Instituta Matematiki i Mekhaniki UrO RAN). 2019. Т.25. №2. С.177-184. DOI: 10.21538/0134-4889-2019-25-2-177-184 WOS Scopus OpenAlex
46 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
47 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
48 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
49 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
50 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
51 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
52 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
53 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
54 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
55 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
56 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
57 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
58 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
59 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
60 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

  • « Previous
  • 1
  • 2
  • 3
  • 4
  • Next  »
3   /  4   -  Total 70 records

Filter

Order

Field Direction

Columns

Reset