Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. - Oleg Duginov (Discret. Math. Theor. Comput. Sci., 2014)

Secure total domination in graphs: Bounds and complexity. - Oleg Duginov (Discret. Appl. Math., 2017)

Bottleneck subset-type restricted matching problems. - Oleg Duginov (J. Comb. Optim., 2020)

Partitioning vertices of graphs into paths of the same length. - Oleg Duginov; Dmitriy Malyshev; Dmitriy Mokeev (Discret. Appl. Math., 2025)