Publications in Math-Net.Ru
-
Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
Prikl. Diskr. Mat., 2024, no. 64, 112–127
-
On problem of finding all maximal induced bicliques of hypergraph
J. Sib. Fed. Univ. Math. Phys., 14:5 (2021), 638–646
-
On accuracy of approximation for the resource constrained shortest path problem
J. Sib. Fed. Univ. Math. Phys., 12:5 (2019), 621–627
-
Approximate algorithm for searching shortest path in multiservice network with constrained resource
Prikl. Diskr. Mat. Suppl., 2019, no. 12, 186–191
-
Algorithm for optimal routing in multi-service networks
Prikl. Diskr. Mat. Suppl., 2018, no. 11, 122–127
-
Optimal routing by landmarks in the time-dependent networks
Prikl. Diskr. Mat., 2017, no. 37, 114–123
-
Two-phase routing algorithm in the time-dependent networks
Prikl. Diskr. Mat. Suppl., 2017, no. 10, 168–171
© , 2026