Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Pyatkin, Artem Valir'evich
Head Scientist Researcher
Doctor of physico-mathematical sciences
E-mail: ,
Website: https://a-server.math.nsc.ru/IM/sotrudl.asp?CodID=725

https://www.mathnet.ru/eng/person27792
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/606283

Publications in Math-Net.Ru Citations
2024
1. A. V. Pyatkin, “On the complexity of the problem of choice of large clusters”, Diskretn. Anal. Issled. Oper., 31:2 (2024),  136–143  mathnet; J. Appl. Industr. Math., 18:2 (2024), 312–315
2023
2. A. V. Pyatkin, “Ptas for problems of vector choice and clustering with different centers”, Diskretn. Anal. Issled. Oper., 30:3 (2023),  96–110  mathnet
2022
3. A. V. Pyatkin, O. I. Chernykh, “On the maximum number of open triangles in graphs with the same number of vertices and edges”, Diskretn. Anal. Issled. Oper., 29:1 (2022),  46–55  mathnet
4. A. V. Pyatkin, I. D. Chernykh, “On complexity of two-machine routing propotionate open shop”, Sib. Èlektron. Mat. Izv., 19:2 (2022),  528–539  mathnet  mathscinet
2020
5. M. O. Golovachev, A. V. Pyatkin, “On a routing Open Shop Problem on two nodes with unit processing times”, Diskretn. Anal. Issled. Oper., 27:3 (2020),  53–70  mathnet; J. Appl. Industr. Math., 14:3 (2020), 470–479  scopus
6. A. V. Kel'manov, A. V. Pyatkin, V. I. Khandeev, “Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters”, Zh. Vychisl. Mat. Mat. Fiz., 60:1 (2020),  151–158  mathnet  elib; Comput. Math. Math. Phys., 60:1 (2020), 163–170  isi  scopus
2019
7. R. A. van Bevern, A. V. Pyatkin, S. V. Sevastyanov, “An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times”, Sib. Èlektron. Mat. Izv., 16 (2019),  42–84  mathnet  isi 8
8. A. V. Kel'manov, A. V. Pyatkin, V. I. Khandeev, “Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Size of the Clusters: Complexity and Approximability”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019),  69–78  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 313, suppl. 1 (2021), S117–S124  isi  scopus
9. A. V. Pyatkin, “On a list $(k,l)$-coloring of incidentors in multigraphs of even degree for some values of $k$ and $l$”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:2 (2019),  177–184  mathnet  elib
2018
10. s. V. Kitaev, A. V. Pyatkin, “Word-representable graphs: a survey”, Diskretn. Anal. Issled. Oper., 25:2 (2018),  19–53  mathnet  elib; J. Appl. Industr. Math., 12:2 (2018), 278–296  scopus 5
11. A. V. Kel'manov, A. V. Pyatkin, V. I. Khandeev, “On the Complexity of Some Max–Min Clustering Problems”, Trudy Inst. Mat. i Mekh. UrO RAN, 24:4 (2018),  189–198  mathnet  elib; Proc. Steklov Inst. Math. (Suppl.), 309, suppl. 1 (2020), S65–S73  isi 3
12. A. V. Kel'manov, A. V. Pyatkin, “Np-hardness of some Euclidean problems of partitioning a finite set of points”, Zh. Vychisl. Mat. Mat. Fiz., 58:5 (2018),  852–856  mathnet  elib; Comput. Math. Math. Phys., 58:5 (2018), 822–826  isi  scopus 5
2017
13. M. O. Golovachev, A. V. Pyatkin, “On $(1,l)$-coloring of incidentors of multigraphs”, Diskretn. Anal. Issled. Oper., 24:4 (2017),  34–46  mathnet  elib; J. Appl. Industr. Math., 11:4 (2017), 514–520  scopus
14. E. I. Vasilyeva, A. V. Pyatkin, “On list incidentor $(k,l)$-colorings”, Diskretn. Anal. Issled. Oper., 24:1 (2017),  21–30  mathnet  mathscinet  elib; J. Appl. Industr. Math., 11:1 (2017), 125–129  scopus 1
2016
15. A. V. Eremeev, A. V. Kel'manov, A. V. Pyatkin, “On the complexity and approximability of some Euclidean optimal summing problems”, Zh. Vychisl. Mat. Mat. Fiz., 56:10 (2016),  1831–1836  mathnet  elib; Comput. Math. Math. Phys., 56:10 (2016), 1813–1817  isi  scopus
16. A. V. Kel'manov, A. V. Pyatkin, “On the complexity of some quadratic Euclidean 2-clustering problems”, Zh. Vychisl. Mat. Mat. Fiz., 56:3 (2016),  498–504  mathnet  elib; Comput. Math. Math. Phys., 56:3 (2016), 491–497 10
2015
17. A. V. Pyatkin, “On interval $(1,1)$-coloring of incidentors of interval colorable graphs”, Diskretn. Anal. Issled. Oper., 22:2 (2015),  63–72  mathnet  mathscinet  elib; J. Appl. Industr. Math., 9:2 (2015), 271–274 1
2014
18. A. A. Ageev, A. V. Kel'manov, A. V. Pyatkin, “Complexity of the Euclidean max cut problem”, Diskretn. Anal. Issled. Oper., 21:4 (2014),  3–11  mathnet  mathscinet; J. Appl. Industr. Math., 8:4 (2014), 453–457 5
19. A. V. Pyatkin, “On edge muticoloring of unicyclic graphs”, Diskretn. Anal. Issled. Oper., 21:3 (2014),  76–81  mathnet  mathscinet; J. Appl. Industr. Math., 8:3 (2014), 362–365
20. E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “Efficient algorithms with performance estimates for some problems of finding several cliques in a complete undirected weighted graph”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  99–112  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 88–101  isi  scopus 3
2013
21. A. V. Kel'manov, A. V. Pyatkin, “On the complexity of some vector sequence clustering problems”, Diskretn. Anal. Issled. Oper., 20:2 (2013),  47–57  mathnet  mathscinet; J. Appl. Industr. Math., 7:3 (2013), 363–369 21
22. I. I. Eremin, E. Kh. Gimadi, A. V. Kel'manov, A. V. Pyatkin, M. Yu. Khachai, “$2$-approximate algorithm for finding a clique with minimum weight of vertices and edges”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  134–143  mathnet  mathscinet  elib; Proc. Steklov Inst. Math. (Suppl.), 284, suppl. 1 (2014), 87–95  isi  scopus 6
2012
23. A. V. Pyatkin, I. D. Chernykh, “Preemptive routing open shop on a link”, Diskretn. Anal. Issled. Oper., 19:3 (2012),  65–78  mathnet  mathscinet; J. Appl. Industr. Math., 6:3 (2012), 346–354 7
24. A. V. Kel'manov, A. V. Pyatkin, “О сложности некоторых задач выбора подпоследовательности векторов”, Zh. Vychisl. Mat. Mat. Fiz., 52:12 (2012),  2284–2291  mathnet 3
2010
25. A. V. Kel'manov, A. V. Pyatkin, “NP-completeness of some problems of a vectors subset choice”, Diskretn. Anal. Issled. Oper., 17:5 (2010),  37–45  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 5:3 (2011), 352–357  scopus 40
2009
26. A. V. Pyatkin, “On the complexity of the maximum sum length vectors subset choice problem”, Diskretn. Anal. Issled. Oper., 16:6 (2009),  68–73  mathnet  mathscinet  zmath  elib; J. Appl. Industr. Math., 4:4 (2010), 549–552  scopus 11
27. A. A. Ageev, A. V. Pyatkin, “A 2-approximation algorithm for the metric 2-peripatetic salesman problem”, Diskretn. Anal. Issled. Oper., 16:4 (2009),  3–20  mathnet  mathscinet  zmath 6
28. A. V. Kel'manov, A. V. Pyatkin, “Complexity of certain problems of searching for subsets of vectors and cluster analysis”, Zh. Vychisl. Mat. Mat. Fiz., 49:11 (2009),  2059–2065  mathnet  mathscinet; Comput. Math. Math. Phys., 49:11 (2009), 1966–1971  isi  scopus 31
2008
29. E. Kh. Gimadi, A. V. Pyatkin, I. A. Rykov, “On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension”, Diskretn. Anal. Issled. Oper., 15:6 (2008),  11–19  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 4:1 (2010), 48–53  scopus 25
30. A. V. Kel'manov, A. V. Pyatkin, “On one variant of the vectors subset choice problem”, Diskretn. Anal. Issled. Oper., 15:5 (2008),  20–34  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 3:4 (2009), 447–455  scopus 32
31. V. T. Dement'ev, A. V. Pyatkin, “On decentralized transportation problem”, Diskretn. Anal. Issled. Oper., 15:3 (2008),  22–30  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 3:1 (2009), 32–37  scopus 3
2007
32. A. V. Pyatkin, “О предписанной раскраске инциденторов в мультиграфе степени 3”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  80–89  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:4 (2008), 560–565  scopus 1
33. A. V. Pyatkin, “Унициклические целочисленно несуммируемые графы”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  16–24  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:3 (2008), 379–384  scopus
34. V. G. Vizing, A. V. Pyatkin, “Об оценках инциденторного хроматического числа взвешенного неориентированного мультиграфа”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  3–15  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:3 (2008), 432–439  scopus 1
35. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  32–42  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 2:1 (2008), 32–38  scopus 28
2006
36. A. E. Baburin, A. V. Pyatkin, “Polynomial algorithms for solving the vector sum problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006),  3–10  mathnet  mathscinet  zmath  elib; J. Appl. Industr. Math., 1:3 (2007), 268–272  elib  scopus 18
37. V. G. Vizing, A. V. Pyatkin, “On the coloring of incidentors in an oriented weighted multigraph”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  33–44  mathnet  mathscinet  zmath 4
2004
38. A. V. Pyatkin, “On the $(1,1)$-coloring of incidentors of multigraphs of degree 4”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004),  59–62  mathnet  mathscinet  zmath 3
39. A. V. Pyatkin, “Upper and lower bounds for an incidentor $(k,l)$-chromatic number”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:1 (2004),  93–102  mathnet  mathscinet  zmath 4
2003
40. A. A. Dobrynin, L. S. Mel'nikov, A. V. Pyatkin, “Critical Erdős and Dirac graphs of even degree”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  12–22  mathnet  mathscinet  zmath 1
41. A. V. Pyatkin, “Some upper bounds for the incidentor $(k,l)$-chromatic number”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:2 (2003),  66–78  mathnet  mathscinet  zmath 4
2002
42. N. S. Plekhanova, A. V. Pyatkin, “Transmission of messages in a local network with two central computers”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002),  91–99  mathnet  mathscinet 1
43. A. V. Pyatkin, “$(k,l)$-coloring of incidentors of cubic multigraphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  49–53  mathnet  mathscinet 4
2001
44. R. M. Larin, A. V. Pyatkin, “A two-level assignment problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001),  42–51  mathnet  mathscinet  zmath 1
2000
45. V. G. Vizing, L. S. Mel'nikov, A. V. Pyatkin, “On the $(k,l)$-coloring of incidentors”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  29–37  mathnet  mathscinet  zmath 11
46. R. M. Larin, A. V. Pyatkin, “A two-level bimatrix game with payoff regulation”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  54–59  mathnet  mathscinet  zmath 1
1997
47. Yu. V. Shamardin, A. V. Pyatkin, “On the accuracy of a set-partition algorithm”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  79–87  mathnet  mathscinet  zmath
1995
48. A. V. Pyatkin, “Some problems for optimizing the routing of messages in a local communication network”, Diskretn. Anal. Issled. Oper., 2:4 (1995),  74–79  mathnet  mathscinet  zmath 15

Presentations in Math-Net.Ru
1. Концепция инциденторных раскрасок
A. V. Pyatkin

November 9, 2022 11:00   

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025