|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
E. A. Monakhova, O. G. Monakhov, “A method for automatic search for families of optimal chordal ring networks”, Diskretn. Anal. Issled. Oper., 31:1 (2024), 85–108  ; J. Appl. Industr. Math., 18:1 (2024), 1221–136 |
| 2. |
E. A. Monakhova, O. G. Monakhov, “Database analysis of optimal double-loop networks”, Prikl. Diskr. Mat., 2024, no. 64, 56–71 |
|
2022 |
| 3. |
E. A. Monakhova, O. G. Monakhov, “Construction of series of families of degree six circulant networks”, Diskretn. Anal. Issled. Oper., 29:4 (2022), 59–76  |
| 4. |
E. A. Monakhova, O. G. Monakhov, “Effective algorithm for finding shortest paths in dense Gaussian networks”, Prikl. Diskr. Mat., 2022, no. 58, 94–104 |
|
2021 |
| 5. |
E. A. Monakhova, “Series of families of degree six circulant graphs”, Prikl. Diskr. Mat., 2021, no. 54, 109–124  |
1
|
|
2020 |
| 6. |
E. A. Monakhova, “A set of families of analytically described triple loop networks defined by a parameter”, Prikl. Diskr. Mat., 2020, no. 49, 108–119 |
1
|
| 7. |
E. A. Monakhova, “A computation of the shortest paths in optimal two-dimensional circulant networks”, Prikl. Diskr. Mat., 2020, no. 47, 87–100 |
1
|
| 8. |
O. G. Monakhov, E. A. Monakhova, “Development of a metaheuristic programming
method for the nonlinear models synthesis”, Sib. Zh. Vychisl. Mat., 23:4 (2020), 415–429  ; Num. Anal. Appl., 13:4 (2020), 349–359 |
|
2018 |
| 9. |
E. A. Monakhova, “New families of multiplicative circulant networks”, Prikl. Diskr. Mat., 2018, no. 41, 76–84 |
|
2017 |
| 10. |
O. G. Monakhov, E. A. Monakhova, “A parallel algorithm of the multivariant evolutionary synthesis of nonlinear models”, Sib. Zh. Vychisl. Mat., 20:2 (2017), 169–180 ; Num. Anal. Appl., 10:2 (2017), 140–148  |
3
|
|
2016 |
| 11. |
O. G. Monakhov, E. A. Monakhova, M. Pant, “Application of differential evolution algorithm for optimization of strategies based on financial time series”, Sib. Zh. Vychisl. Mat., 19:2 (2016), 195–205 ; Num. Anal. Appl., 9:2 (2016), 150–158 |
5
|
|
2015 |
| 12. |
E. A. Monakhova, O. G. Monakhov, “Searching for record circulant graphs using a parallel genetic algorithm”, Diskretn. Anal. Issled. Oper., 22:6 (2015), 29–42 |
2
|
|
2014 |
| 13. |
E. A. Monakhova, O. G. Monakhov, “On the problem of circulant networks with the maximal number of nodes for any diameter”, Prikl. Diskr. Mat., 2014, no. 3(25), 81–85 |
|
2013 |
| 14. |
E. A. Monakhova, “A new attainable lower bound on the number of nodes in quadruple circulant networks”, Diskretn. Anal. Issled. Oper., 20:1 (2013), 37–44 |
2
|
| 15. |
E. A. Monakhova, “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 |
1
|
|
2011 |
| 16. |
E. A. Monakhova, “On an extremal family of circulant networks”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 77–84  ; J. Appl. Industr. Math., 5:4 (2011), 595–600 |
3
|
| 17. |
E. A. Monakhova, “Structural and communicative properties of circulant networks”, Prikl. Diskr. Mat., 2011, no. 3(13), 92–115 |
13
|
|
2010 |
| 18. |
E. A. Monakhova, “Multiplicative circulant networks”, Diskretn. Anal. Issled. Oper., 17:5 (2010), 56–66 |
3
|
|
2009 |
| 19. |
E. A. Monakhova, “Optimal generalized Petersen graphs”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 47–60 |
1
|
|
2008 |
| 20. |
È. A. Monakhova, “Optimization of quadruple circulant networks”, Diskretn. Anal. Issled. Oper., 15:3 (2008), 58–64 |
4
|
|
| Organisations |
|
| |
|
|
Contact us: