Computing Best Possible Pseudo-Solutions to Interval Linear Systems of Equations. - Anatoly V. Panyukov; Valentin A. Golodov (Reliab. Comput., 2013)

Polynomial solvability of $NP$-complete problems. - Anatoly V. Panyukov (CoRR, 2014)

AOE-Trails Constructing for a Plane Connected 4-Regular Graph. - Tatiana A. Makarovskikh; Anatoly V. Panyukov (DOOR (Supplement), 2016)

Algorithm for the discrete Weber's problem with an accuracy estimate. - Anatoly V. Panyukov; Roman E. Shangin (Autom. Remote. Control., 2016)

Mathematical models and routing algorithms for CAD technological preparation of cutting processes. - Tatiana A. Makarovskikh; Anatoly V. Panyukov; Egor A. Savitskiy (Autom. Remote. Control., 2017)

Mathematical models and routing algorithms for economical cutting tool paths. - Tatiana A. Makarovskikh; Anatoly V. Panyukov; Egor A. Savitskiy (Int. J. Prod. Res., 2018)

On the Existence of an Integer Solution to the Relaxed Weber Problem for a Tree Network. - Anatoly V. Panyukov (Autom. Remote. Control., 2019)

Software for the Problem of Constructing Cutting Tool Paths in CAD/CAM Systems for Technological Preparation of Cutting Processes. - Tatiana A. Makarovskikh; Anatoly V. Panyukov (Autom. Remote. Control., 2021)

Forecasting with Using Quasilinear Recurrence Equation. - Anatoly V. Panyukov; Tatiana A. Makarovskikh; Mostafa Abotaleb (OPTIMA (2), 2022)