|
|
Publications in Math-Net.Ru
-
Possibilities of parallelism under identifying a quasi-linear recurrent equation
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 12:4 (2023), 94–109
-
Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
Avtomat. i Telemekh., 2021, no. 3, 123–137
-
Automatic selection of ARIMA model parameters to forecast Covid-19 infection and death cases
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 10:2 (2021), 20–37
-
Constructing self-non-intersecting $OE$-chains in a plane eulerian graph
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 8:4 (2019), 30–42
-
Software for constructing of A-chains with ordered enclosing for a plane connected 4-regular graph
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 8:1 (2019), 36–53
-
Mathematical models and routing algorithms for CAD technological preparation of cutting processes
Avtomat. i Telemekh., 2017, no. 5, 123–140
-
On the number of $OE$-trails for a fixed transition system
Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 8:1 (2016), 5–12
-
The algorithms for constructing of cutter optimal path
J. Comp. Eng. Math., 1:2 (2014), 52–61
-
Constructing of $OE$-postman path for a planar graph
Vestnik YuUrGU. Ser. Mat. Model. Progr., 7:4 (2014), 90–101
-
The software for constructing a graph covering with ordered enclosing for multiconnected planar graphs
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 2:2 (2013), 111–117
-
Optimal Eulerian coverings with ordered enclosing for plane graphs
Diskretn. Anal. Issled. Oper., 18:2 (2011), 64–74
-
The paths with local restrictions
Vestnik YuUrGU. Ser. Mat. Model. Progr., 2010, no. 5, 58–67
-
By-passes with ordered enclosing in planar graphs
Diskretn. Anal. Issled. Oper., Ser. 2, 13:2 (2006), 31–43
-
On 65th anniversary of professor A. V. Panyukov
Vestn. Yuzhno-Ural. Gos. Un-ta. Ser. Matem. Mekh. Fiz., 9:1 (2017), 72–74
© , 2024