Lepin Viktor Vasil'evich

Publications in Math-Net.Ru

1. Application of the clique minimal separator decomposition to finding the maximum weight $\{K_1,K_2,k,l\}$-packing in a graph
   
   Tr. Inst. Mat., 30:1-2 (2022),  44–49
2. An approximation algorithm for finding a $\{C_4,P_5\}$-hitting set of the minimal weight in a graph
   
   Tr. Inst. Mat., 28:1-2 (2020),  63–73
3. Topological indices of cographs
   
   Tr. Inst. Mat., 27:1-2 (2019),  108–126
4. Solving the problem of findingan independent $\{K_1,K_2\}$-packing of maximum weight in tree-cographs
   
   Tr. Inst. Mat., 27:1-2 (2019),  53–59
5. The weighted $k$-path vertex cover problem on series-parallel graphs
   
   Tr. Inst. Mat., 25:1 (2017),  62–81
6. Some cases of the polynomial solvability of the problem of findingan independent $\{K_1,K_2\}$-packing of maximum weight in a graph
   
   Tr. Inst. Mat., 24:2 (2016),  72–90
7. Solving the weighted $k$-separator problem in graphs with specific modules
   
   Tr. Inst. Mat., 24:1 (2016),  61–74
8. Solving the problem of finding an independent $\{K_1,K_2\}$-packing of maximum weight on graphs with special blocks
   
   Tr. Inst. Mat., 23:2 (2015),  62–71
9. Solving the problem of finding an independent $\{K_1,K_2\}$-packing of maximum weight on graphs of bounded treewidth
   
   Tr. Inst. Mat., 23:1 (2015),  98–114
10. Algorithms for finding an independent $\{K_1,K_2\}$-packing of maximum weight in a graph
    
    Tr. Inst. Mat., 22:1 (2014),  78–97
11. Problems and invariants connected with bicliques and multicliques of graphs
    
    Tr. Inst. Mat., 21:2 (2013),  103–127
12. On biclique covering number of the Cartesian product of graphs
    
    Tr. Inst. Mat., 21:1 (2013),  78–87
13. Computation of the biclique partition number for graphs with specific blocks
    
    Tr. Inst. Mat., 20:1 (2012),  60–73
14. Algorithms for finding biclique covers of graphs with bounded pathwidth
    
    Tr. Inst. Mat., 19:2 (2011),  69–81
15. On cycle covers of graphs with bounded pathwidth
    
    Tr. Inst. Mat., 19:1 (2011),  71–84
16. The profile of the corona $G\wedge H$, where $G$ is a Halin graph, whose tree is a caterpillar
    
    Tr. Inst. Mat., 18:2 (2010),  79–86
17. Algorithms for computing the multiclique degree and the biclique degreeof a series-parallel graph
    
    Tr. Inst. Mat., 18:2 (2010),  60–78
18. Algorithms for solving problems on graphs of bounded pathwidth
    
    Tr. Inst. Mat., 18:1 (2010),  53–71
19. A linear algorithm for computing the multiclique cover number of a series-parallel graph
    
    Tr. Inst. Mat., 17:1 (2009),  90–102
20. A linear algorithm for computing the biclique cover number of a series-parallel graph
    
    Tr. Inst. Mat., 16:2 (2008),  63–75
21. Algorithms for solution $k$-Star Hub Problem for trees and series-parallel graphs
    
    Tr. Inst. Mat., 15:2 (2007),  48–57
22. A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
    
    Tr. Inst. Mat., 15:1 (2007),  78–90
23. A polynomial time algorithm for checking $2$-chromaticity for recursively constructed $k$-terminal hypergraphs
    
    Tr. Inst. Mat., 14:2 (2006),  80–85


24. Members of the National Academy of Sciences of Belarus at the Institute of mathematics
    
    Tr. Inst. Mat., 17:1 (2009),  3–18