RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 
Lepin, Viktor Vasil'evich

Statistics Math-Net.Ru
Total publications: 19
Scientific articles: 18

Number of views:
This page:786
Abstract pages:4550
Full texts:2446
References:431
Associate professor
Candidate of physico-mathematical sciences
E-mail:

http://www.mathnet.ru/eng/person69128
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
2017
1. V. V. Lepin, “The weighted $k$-path vertex cover problem on series-parallel graphs”, Tr. Inst. Mat., 25:1 (2017),  62–81  mathnet
2016
2. V. V. Lepin, “Solving the weighted $k$-separator problem in graphs with specific modules”, Tr. Inst. Mat., 24:1 (2016),  61–74  mathnet
2015
3. 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  mathnet
4. 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  mathnet
2014
5. 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  mathnet
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
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
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
10. V. V. Lepin, “On cycle covers of graphs with bounded pathwidth”, Tr. Inst. Mat., 19:1 (2011),  71–84  mathnet
2010
11. 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  mathnet  zmath
12. 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  mathnet  zmath
13. V. V. Lepin, “Algorithms for solving problems on graphs of bounded pathwidth”, Tr. Inst. Mat., 18:1 (2010),  53–71  mathnet
2009
14. 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  mathnet  zmath
2008
15. 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  mathnet  zmath
2007
16. V. V. Lepin, “Algorithms for solution $k$-Star Hub Problem for trees and series-parallel graphs”, Tr. Inst. Mat., 15:2 (2007),  48–57  mathnet
17. 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  mathnet
2006
18. 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  mathnet

2009
19. 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  mathnet  zmath

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020