Monakhova Èmiliya Anatol'evna

Publications in Math-Net.Ru

1. A scalable approach to co-design of topologies and routing algorithms for families of optimal degree-four circulant networks
   
   Diskretn. Anal. Issled. Oper., 32:2 (2025),  88–106
2. A method for automatic search for families of optimal chordal ring networks
   
   Diskretn. Anal. Issled. Oper., 31:1 (2024),  85–108
3. Discovery of infinite families of optimal double-loop networks with a given template of generators
   
   Prikl. Diskr. Mat., 2024, no. 66,  97–115
4. Database analysis of optimal double-loop networks
   
   Prikl. Diskr. Mat., 2024, no. 64,  56–71
5. Construction of series of families of degree six circulant networks
   
   Diskretn. Anal. Issled. Oper., 29:4 (2022),  59–76
6. Effective algorithm for finding shortest paths in dense Gaussian networks
   
   Prikl. Diskr. Mat., 2022, no. 58,  94–104
7. Series of families of degree six circulant graphs
   
   Prikl. Diskr. Mat., 2021, no. 54,  109–124
8. A set of families of analytically described triple loop networks defined by a parameter
   
   Prikl. Diskr. Mat., 2020, no. 49,  108–119
9. A computation of the shortest paths in optimal two-dimensional circulant networks
   
   Prikl. Diskr. Mat., 2020, no. 47,  87–100
10. Development of a metaheuristic programming method for the nonlinear models synthesis
    
    Sib. Zh. Vychisl. Mat., 23:4 (2020),  415–429
11. New families of multiplicative circulant networks
    
    Prikl. Diskr. Mat., 2018, no. 41,  76–84
12. A parallel algorithm of the multivariant evolutionary synthesis of nonlinear models
    
    Sib. Zh. Vychisl. Mat., 20:2 (2017),  169–180
13. Application of differential evolution algorithm for optimization of strategies based on financial time series
    
    Sib. Zh. Vychisl. Mat., 19:2 (2016),  195–205
14. Searching for record circulant graphs using a parallel genetic algorithm
    
    Diskretn. Anal. Issled. Oper., 22:6 (2015),  29–42
15. On the problem of circulant networks with the maximal number of nodes for any diameter
    
    Prikl. Diskr. Mat., 2014, no. 3(25),  81–85
16. A new attainable lower bound on the number of nodes in quadruple circulant networks
    
    Diskretn. Anal. Issled. Oper., 20:1 (2013),  37–44
17. On a construction of quadruple circulant networks with the maximal number of nodes for any diameter
    
    Prikl. Diskr. Mat., 2013, no. 3(21),  76–85
18. On an extremal family of circulant networks
    
    Diskretn. Anal. Issled. Oper., 18:1 (2011),  77–84
19. Structural and communicative properties of circulant networks
    
    Prikl. Diskr. Mat., 2011, no. 3(13),  92–115
20. Multiplicative circulant networks
    
    Diskretn. Anal. Issled. Oper., 17:5 (2010),  56–66
21. Optimal generalized Petersen graphs
    
    Diskretn. Anal. Issled. Oper., 16:4 (2009),  47–60
22. Optimization of quadruple circulant networks
    
    Diskretn. Anal. Issled. Oper., 15:3 (2008),  58–64