01.01.09 (Discrete mathematics and mathematical cybernetics)
UDC:
519.1
Subject:
Graph theory, combinatorial optimization, operations research
Main publications:
Duginov O., “Secure total domination in graphs: Bounds and complexity”, Discrete Applied Mathematics, 222 (2017), 97-108
Duginov O., “Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs”, Discrete Mathematics and Theoretical Computer Science, 16:3 (2014), 203-214
D. S. Malyshev, O. I. Duginov, “A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs”, Diskretn. Anal. Issled. Oper., 30:4 (2023), 91–109; J. Appl. Industr. Math., 17:4 (2023), 791–801
2022
2.
D. S. Malyshev, O. I. Duginov, “Some cases of polynomial solvability for the edge colorability problem generated by forbidden $8$-edge subcubic forests”, Diskretn. Anal. Issled. Oper., 29:2 (2022), 38–61
O. I. Duginov, B. M. Kuskova, D. S. Malyshev, N. A. Shur, “Structural and algorithmic properties of maximal dissociating sets in graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022), 114–142
2021
4.
O. I. Duginov, “A weighted perfect matching with constraints on weights of its parts”, Diskretn. Anal. Issled. Oper., 28:3 (2021), 5–37
2014
5.
O. I. Duginov, “The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs”, Tr. Inst. Mat., 22:1 (2014), 51–69