Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Duginov, Oleg Ivanovich
Statistics Math-Net.Ru
Total publications: 9
Scientific articles: 9

Number of views:
This page:641
Abstract pages:3042
Full texts:1656
References:235
Candidate of physico-mathematical sciences
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
UDC: 519.1

Subject:

Graph theory, combinatorial optimization, operations research
   
Main publications:
  1. Duginov O., “Secure total domination in graphs: Bounds and complexity”, Discrete Applied Mathematics, 222 (2017), 97-108
  2. 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

https://www.mathnet.ru/eng/person72207
List of publications on Google Scholar
List of publications on ZentralBlatt
https://orcid.org/0000-0003-0740-887X
https://www.scopus.com/authid/detail.url?authorId=56392883100

Publications in Math-Net.Ru Citations
2023
1. 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  mathnet; 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  mathnet  mathscinet 1
3. 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  mathnet  mathscinet  elib
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  mathnet
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  mathnet 1
2013
6. V. V. Lepin, O. I. Duginov, “Problems and invariants connected with bicliques and multicliques of graphs”, Tr. Inst. Mat., 21:2 (2013),  103–127  mathnet
7. V. V. Lepin, O. I. Duginov, “On biclique covering number of the Cartesian product of graphs”, Tr. Inst. Mat., 21:1 (2013),  78–87  mathnet 1
2012
8. V. V. Lepin, O. I. Duginov, “Computation of the biclique partition number for graphs with specific blocks”, Tr. Inst. Mat., 20:1 (2012),  60–73  mathnet 1
2011
9. V. V. Lepin, O. I. Duginov, “Algorithms for finding biclique covers of graphs with bounded pathwidth”, Tr. Inst. Mat., 19:2 (2011),  69–81  mathnet 3

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024