Duginov Oleg Ivanovich

Publications in Math-Net.Ru

1. 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
2. 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
3. Structural and algorithmic properties of maximal dissociating sets in graphs
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022),  114–142
4. A weighted perfect matching with constraints on weights of its parts
   
   Diskretn. Anal. Issled. Oper., 28:3 (2021),  5–37
5. 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
6. Problems and invariants connected with bicliques and multicliques of graphs
   
   Tr. Inst. Mat., 21:2 (2013),  103–127
7. On biclique covering number of the Cartesian product of graphs
   
   Tr. Inst. Mat., 21:1 (2013),  78–87
8. Computation of the biclique partition number for graphs with specific blocks
   
   Tr. Inst. Mat., 20:1 (2012),  60–73
9. Algorithms for finding biclique covers of graphs with bounded pathwidth
   
   Tr. Inst. Mat., 19:2 (2011),  69–81