01.01.09 (Discrete mathematics and mathematical cybernetics)
Main publications:
Optimizatsionnye zadachi proizvodstvenno-transportnogo planirovaniya : Modeli, metody, algoritmy / V. S. Mikhalevich, V. A. Trubin, N. Z. Shor. - Moskva : Nauka, 1986. - 259,[1] s. : il.
V. A. Trubin, “Strength decomposition of graphs”, Dokl. Akad. Nauk, 335:1 (1994), 27–28; Dokl. Math., 49:2 (1994), 244–247
2.
D. D. Lozovanu, V. A. Trubin, “The problem of the minimax path in a network and an algorithm for its solution”, Diskr. Mat., 6:2 (1994), 138–144; Discrete Math. Appl., 4:5 (1994), 447–453
V. A. Trubin, “Network uniformity deficit and its reduction”, Dokl. Akad. Nauk SSSR, 318:1 (1991), 43–47; Dokl. Math., 43:3 (1991), 670–673
4.
V. A. Trubin, “On the determination of graph strength”, Dokl. Akad. Nauk SSSR, 316:5 (1991), 1060–1064; Dokl. Math., 43:1 (1991), 246–249
1976
5.
V. A. Trubin, “An effective algorithm for solving the distribution problem in a network in the form of a tree”, Dokl. Akad. Nauk SSSR, 231:3 (1976), 547–550