Publications in Math-Net.Ru
-
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
Probl. Peredachi Inf., 47:3 (2011), 59–63
-
Computing the longest common substring with one mismatch
Probl. Peredachi Inf., 47:1 (2011), 33–39
-
An application of the structural theory of acyclic skew-symmetric graphs
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2007, no. 2, 65–66
-
On Flows in Simple Bidirected and Skew-Symmetric Networks
Probl. Peredachi Inf., 42:4 (2006), 104–120
-
A fast algorithm for constructing the decomposition of multipolar flows
Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, no. 2, 52–54
© , 2024