Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
О. И. Дугинов
Observed names:
Duginov, O. I.,
Duginov, Oleg,
O. I. Duginov,
Oleg Duginov,
Дугинов, О. И.,
Дугинов, О.И.
show all 6
Institution:
Belarusian State University of Informatics and Radioelectronics
Observed institutions:
National Academy of Sciences of Belarus,
Süleyman Demirel Üniversitesi,
Belarusian State University,
Institute of Mathematics,
Düzce Üniversitesi,
Belarusian State University of Informatics and Radioelectronics
show all 6
ORCID:
0000-0003-0740-887X
Observed ORCID:
0000-0003-0740-887X
OpenAlex ID:
A5014183166
Secure total domination in graphs: Bounds and complexity
2017
·
Oleg Duginov
·
Discrete Applied Mathematics
·
20
PDF
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
2014
·
Oleg Duginov
·
Discrete Mathematics & Theoretical Computer Science
·
6
PDF
A Complete Complexity Dichotomy of the Edge-Coloring Problem for All Sets of $$8$$-Edge Forbidden Subgraphs
2023
·
D. S. Malyshev
, O. I. Duginov
·
Journal of Applied and Industrial Mathematics
·
2
Some Cases of Polynomial Solvability of the Edge Coloring Problem That Are Generated by Forbidden 8-Edge Subcubic Forests
2022
·
D. S. Malyshev
, O. I. Duginov
·
Journal of Applied and Industrial Mathematics
·
2
Weighted Perfect Matching with Constraints on the Total Weight of Its Parts
2021
·
O. I. Duginov
·
Journal of Applied and Industrial Mathematics
·
1
Partitioning a split graph into induced subgraphs isomorphic to the path of order 3.
2019
·
O. I. Duginov
·
Proceedings of the National Academy of Sciences of Belarus Physics and Mathematics Series
·
1
PDF
On the complexity of the clustering minimum Biclique completion problem
2015
·
О. И. Дугинов
·
Digital Library of the Belarusian State University (Belarusian State University)
·
1
Partitioning vertices of graphs into paths of the same length
2025
·
Oleg Duginov
, Dmitriy Malyshev
, et al.
·
Discrete Applied Mathematics
Chordal bipartite graphs, biclique vertex partitions and Castelnuovo-Mumford regularity of $1$-subdivision graphs
2024
·
Civan, Yusuf
, Deniz, Zakir
, et al.
·
arXiv (Cornell University)
PDF
Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
2022
·
O. I. Duginov
, S. S. Khimich
·
Proceedings of the National Academy of Sciences of Belarus Physics and Mathematics Series
PDF
Структурные и алгоритмические свойства максимальных диссоциирующих множеств в графах
2022
·
О. И. Дугинов
, Б. М. Кускова
, et al.
·
Trudy Instituta Matematiki i Mekhaniki UrO RAN
PDF
Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests
2022
·
Малышев, Д.С.
, Дугинов, О.И.
·
Digital Library of the Belarusian State University (Belarusian State University)
PDF
A weighted perfect matching with constraints on weights of its parts
2021
·
O. I. Duginov
·
Diskretnyi analiz i issledovanie operatsii
PDF
Bottleneck subset-type restricted matching problems
2020
·
Oleg Duginov
·
Journal of Combinatorial Optimization
Дискретная математика и математическая логика. № УД-5083/уч.
2018
·
О. И. Дугинов
Secure total domination in graphs: properties and complexity
2016
·
О. И. Дугинов
·
BSU Digital Library (Belarusian State University)
PDF
Задача Минимального Пополнения Двудольного Графа
2016
·
О. И. Дугинов
, И. Г. Кузнецова
·
zvestiya of the National Academy of Sciences of Belarus (National Academy of Sciences of Belarus)
Computation of the vertex covering number of a graph, each block of which is a complete graph or a complete bipartite graph or a wheel or a power of a cycle or a power of a path
2013
·
Lepin, V. V.
, Talmaciu, M.
, et al.
·
BSU Digital Library (Belarusian State University)
Show more works
View as search
Works count:
27
Citation count:
33
H-index:
2
I10-index:
1
Year
Topic
Type
