|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
V. V. Lepin, “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  |
|
2020 |
| 2. |
V. V. Lepin, “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 |
|
2019 |
| 3. |
V. V. Lepin, V. I. Benediktovich, M. Talmaciu, “Topological indices of cographs”, Tr. Inst. Mat., 27:1-2 (2019), 108–126 |
| 4. |
V. V. Lepin, “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 |
|
2017 |
| 5. |
V. V. Lepin, “The weighted $k$-path vertex cover problem on series-parallel graphs”, Tr. Inst. Mat., 25:1 (2017), 62–81 |
|
2016 |
| 6. |
V. V. Lepin, “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. |
V. V. Lepin, “Solving the weighted $k$-separator problem in graphs with specific modules”, Tr. Inst. Mat., 24:1 (2016), 61–74 |
1
|
|
2015 |
| 8. |
V. V. Lepin, “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 |
3
|
| 9. |
V. V. Lepin, “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 |
4
|
|
2014 |
| 10. |
V. V. Lepin, “Algorithms for finding an independent $\{K_1,K_2\}$-packing of maximum weight in a graph”, Tr. Inst. Mat., 22:1 (2014), 78–97 |
5
|
|
2013 |
| 11. |
V. V. Lepin, O. I. Duginov, “Problems and invariants connected with bicliques and multicliques of graphs”, Tr. Inst. Mat., 21:2 (2013), 103–127 |
| 12. |
V. V. Lepin, O. I. Duginov, “On biclique covering number of the Cartesian product of graphs”, Tr. Inst. Mat., 21:1 (2013), 78–87 |
1
|
|
2012 |
| 13. |
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 |
1
|
|
2011 |
| 14. |
V. V. Lepin, O. I. Duginov, “Algorithms for finding biclique covers of graphs with bounded pathwidth”, Tr. Inst. Mat., 19:2 (2011), 69–81 |
3
|
| 15. |
V. V. Lepin, “On cycle covers of graphs with bounded pathwidth”, Tr. Inst. Mat., 19:1 (2011), 71–84 |
|
2010 |
| 16. |
V. V. Lepin, S. A. Tsikhan, “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. |
V. V. Lepin, “Algorithms for computing the multiclique degree and the biclique degreeof a series-parallel graph”, Tr. Inst. Mat., 18:2 (2010), 60–78 |
2
|
| 18. |
V. V. Lepin, “Algorithms for solving problems on graphs of bounded pathwidth”, Tr. Inst. Mat., 18:1 (2010), 53–71 |
2
|
|
2009 |
| 19. |
V. V. Lepin, “A linear algorithm for computing the multiclique cover number of a series-parallel graph”, Tr. Inst. Mat., 17:1 (2009), 90–102 |
3
|
|
2008 |
| 20. |
V. V. Lepin, “A linear algorithm for computing the biclique cover number of a series-parallel graph”, Tr. Inst. Mat., 16:2 (2008), 63–75 |
6
|
|
2007 |
| 21. |
V. V. Lepin, “Algorithms for solution $k$-Star Hub Problem for trees and series-parallel graphs”, Tr. Inst. Mat., 15:2 (2007), 48–57 |
| 22. |
V. V. Lepin, “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 |
3
|
|
2006 |
| 23. |
V. V. Lepin, “A polynomial time algorithm for checking $2$-chromaticity for recursively constructed $k$-terminal hypergraphs”, Tr. Inst. Mat., 14:2 (2006), 80–85 |
|
|
|
2009 |
| 24. |
V. V. Lepin, P. P. Matus, P. I. Sobolevsky, “Members of the National Academy of Sciences of Belarus at the Institute of mathematics”, Tr. Inst. Mat., 17:1 (2009), 3–18 |
|
| Organisations |
|
| |
|
|
Contact us: