Gordeev Eduard Nikolaevich

Publications in Math-Net.Ru

1. On relations associated with the Euler function
   
   Diskretn. Anal. Issled. Oper., 30:4 (2023),  35–45
2. On the number of solutions to linear Diophantine equation and Frobenius problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 62:9 (2022),  1447–1457
3. On the number of solutions to a system of Boolean equations
   
   Avtomat. i Telemekh., 2021, no. 9,  150–168
4. On the annihilators of Boolean polynomials
   
   Diskretn. Anal. Issled. Oper., 27:1 (2020),  88–109
5. On combinatorial properties of the knapsack problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 59:8 (2019),  1439–1447
6. On the number of roots of Boolean polynomials
   
   Zh. Vychisl. Mat. Mat. Fiz., 58:7 (2018),  1235–1245
7. Comparison of three approaches to studing stability of solutions to discrete optimization and computational geometry problems
   
   Diskretn. Anal. Issled. Oper., 22:3 (2015),  18–35
8. Stability analysis of the minimum spanning tree problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 39:5 (1999),  770–778
9. The method of nonuniform coverings in discrete optimization problems of a special type
   
   Zh. Vychisl. Mat. Mat. Fiz., 36:5 (1996),  51–61
10. On the stability of the Voronoĭ diagram
    
    Zh. Vychisl. Mat. Mat. Fiz., 36:3 (1996),  147–158
11. A general approach to the study of the stability of solutions in discrete optimization problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 36:1 (1996),  66–72
12. The Steiner problem: A survey
    
    Diskr. Mat., 5:2 (1993),  3–28
13. On the stability of bottleneck problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 33:9 (1993),  1391–1402
14. Stability of a solution in a problem on the shortest path on a graph
    
    Diskr. Mat., 1:3 (1989),  39–46
15. Bottleneck stability in path problems
    
    Avtomat. i Telemekh., 1988, no. 1,  45–52
16. Polynomial algorithms for calculating the stability radius for two classes of choice problems
    
    Dokl. Akad. Nauk SSSR, 297:5 (1987),  1040–1043
17. Algorithms of polynomial complexity for computing the radius of stability in two classes of trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 27:7 (1987),  984–992
18. Estimates of the complexity of tabulating trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 25:8 (1985),  1272–1275
19. Parametric trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:1 (1984),  37–46
20. Computing algorithms for determination of the radius of stability in choice problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 23:4 (1983),  973–979
21. Stability in bottleneck problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 20:4 (1980),  1071–1075