|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
A. A. Soldatenko, D. V. Semenova, E. I. Ibragimova, “Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs”, Prikl. Diskr. Mat., 2024, no. 64, 112–127  |
|
2021 |
| 2. |
Aleksandr A. Soldatenko, Daria V. Semenova, “On problem of finding all maximal induced bicliques of hypergraph”, J. Sib. Fed. Univ. Math. Phys., 14:5 (2021), 638–646  |
1
|
|
2019 |
| 3. |
Aleksandr A. Soldatenko, “On accuracy of approximation for the resource constrained shortest path problem”, J. Sib. Fed. Univ. Math. Phys., 12:5 (2019), 621–627 |
| 4. |
A. A. Soldatenko, “Approximate algorithm for searching shortest path in multiservice network with constrained resource”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 186–191  |
|
2018 |
| 5. |
A. A. Soldatenko, “Algorithm for optimal routing in multi-service networks”, Prikl. Diskr. Mat. Suppl., 2018, no. 11, 122–127 |
1
|
|
2017 |
| 6. |
V. V. Bykova, A. A. Soldatenko, “Optimal routing by landmarks in the time-dependent networks”, Prikl. Diskr. Mat., 2017, no. 37, 114–123 |
5
|
| 7. |
A. A. Soldatenko, “Two-phase routing algorithm in the time-dependent networks”, Prikl. Diskr. Mat. Suppl., 2017, no. 10, 168–171 |
|
| Organisations |
|
| |
|
|
Contact us: