Pyatkin Artem Valir'evich

Publications in Math-Net.Ru

1. On the maximum number of open triangles in graphs with few edges
   
   Diskretn. Anal. Issled. Oper., 31:3 (2024),  144–152
2. On the complexity of the problem of choice of large clusters
   
   Diskretn. Anal. Issled. Oper., 31:2 (2024),  136–143
3. Ptas for problems of vector choice and clustering with different centers
   
   Diskretn. Anal. Issled. Oper., 30:3 (2023),  96–110
4. 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
5. On complexity of two-machine routing propotionate open shop
   
   Sib. Èlektron. Mat. Izv., 19:2 (2022),  528–539
6. On a routing Open Shop Problem on two nodes with unit processing times
   
   Diskretn. Anal. Issled. Oper., 27:3 (2020),  53–70
7. 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
8. 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
9. 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
10. 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
11. Word-representable graphs: a survey
    
    Diskretn. Anal. Issled. Oper., 25:2 (2018),  19–53
12. On the Complexity of Some Max–Min Clustering Problems
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 24:4 (2018),  189–198
13. Np-hardness of some Euclidean problems of partitioning a finite set of points
    
    Zh. Vychisl. Mat. Mat. Fiz., 58:5 (2018),  852–856
14. On $(1,l)$-coloring of incidentors of multigraphs
    
    Diskretn. Anal. Issled. Oper., 24:4 (2017),  34–46
15. On list incidentor $(k,l)$-colorings
    
    Diskretn. Anal. Issled. Oper., 24:1 (2017),  21–30
16. On the complexity and approximability of some Euclidean optimal summing problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 56:10 (2016),  1831–1836
17. On the complexity of some quadratic Euclidean 2-clustering problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 56:3 (2016),  498–504
18. On interval $(1,1)$-coloring of incidentors of interval colorable graphs
    
    Diskretn. Anal. Issled. Oper., 22:2 (2015),  63–72
19. Complexity of the Euclidean max cut problem
    
    Diskretn. Anal. Issled. Oper., 21:4 (2014),  3–11
20. On edge muticoloring of unicyclic graphs
    
    Diskretn. Anal. Issled. Oper., 21:3 (2014),  76–81
21. 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
22. On the complexity of some vector sequence clustering problems
    
    Diskretn. Anal. Issled. Oper., 20:2 (2013),  47–57
23. $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
24. Preemptive routing open shop on a link
    
    Diskretn. Anal. Issled. Oper., 19:3 (2012),  65–78
25. О сложности некоторых задач выбора подпоследовательности векторов
    
    Zh. Vychisl. Mat. Mat. Fiz., 52:12 (2012),  2284–2291
26. NP-completeness of some problems of a vectors subset choice
    
    Diskretn. Anal. Issled. Oper., 17:5 (2010),  37–45
27. On the complexity of the maximum sum length vectors subset choice problem
    
    Diskretn. Anal. Issled. Oper., 16:6 (2009),  68–73
28. A 2-approximation algorithm for the metric 2-peripatetic salesman problem
    
    Diskretn. Anal. Issled. Oper., 16:4 (2009),  3–20
29. Complexity of certain problems of searching for subsets of vectors and cluster analysis
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:11 (2009),  2059–2065
30. On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension
    
    Diskretn. Anal. Issled. Oper., 15:6 (2008),  11–19
31. On one variant of the vectors subset choice problem
    
    Diskretn. Anal. Issled. Oper., 15:5 (2008),  20–34
32. On decentralized transportation problem
    
    Diskretn. Anal. Issled. Oper., 15:3 (2008),  22–30
33. О предписанной раскраске инциденторов в мультиграфе степени 3
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007),  80–89
34. Унициклические целочисленно несуммируемые графы
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  16–24
35. Об оценках инциденторного хроматического числа взвешенного неориентированного мультиграфа
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  3–15
36. The problem of finding a subset of vectors with the maximum total weight
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  32–42
37. Polynomial algorithms for solving the vector sum problem
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006),  3–10
38. On the coloring of incidentors in an oriented weighted multigraph
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  33–44
39. On the $(1,1)$-coloring of incidentors of multigraphs of degree 4
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004),  59–62
40. Upper and lower bounds for an incidentor $(k,l)$-chromatic number
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:1 (2004),  93–102
41. Critical Erdős and Dirac graphs of even degree
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  12–22
42. Some upper bounds for the incidentor $(k,l)$-chromatic number
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:2 (2003),  66–78
43. Transmission of messages in a local network with two central computers
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:2 (2002),  91–99
44. $(k,l)$-coloring of incidentors of cubic multigraphs
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  49–53
45. A two-level assignment problem
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 8:2 (2001),  42–51
46. On the $(k,l)$-coloring of incidentors
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  29–37
47. A two-level bimatrix game with payoff regulation
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000),  54–59
48. On the accuracy of a set-partition algorithm
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  79–87
49. Some problems for optimizing the routing of messages in a local communication network
    
    Diskretn. Anal. Issled. Oper., 2:4 (1995),  74–79