Bykova Valentina Vladimirovna

Publications in Math-Net.Ru

1. On decomposition of a binary context without losing formal concepts
   
   J. Sib. Fed. Univ. Math. Phys., 12:3 (2019),  323–330
2. Decompositional approach to research of formal contexts
   
   Prikl. Diskr. Mat., 2019, no. 44,  113–126
3. On algebraic approach of R. Wille and B. Ganter in the investigation of texts
   
   J. Sib. Fed. Univ. Math. Phys., 10:3 (2017),  372–384
4. Optimal routing by landmarks in the time-dependent networks
   
   Prikl. Diskr. Mat., 2017, no. 37,  114–123
5. On the non-redundant representation of the minimax basis of strong associations
   
   Prikl. Diskr. Mat., 2017, no. 36,  113–126
6. Algorithm for constructing a non-redundant minimax basis of strong associative rules
   
   Prikl. Diskr. Mat. Suppl., 2017, no. 10,  154–157
7. Calculation of upper bounds for graph vertex integrity based on the minimal separators
   
   Prikl. Diskr. Mat. Suppl., 2015, no. 8,  142–144
8. Measures for graph integrity: a comparative survey
   
   Prikl. Diskr. Mat., 2014, no. 4(26),  96–111
9. Structural decomposition of graphs and its application for solving optimization problems on sparse graphs
   
   Prikl. Diskr. Mat. Suppl., 2014, no. 7,  154–157
10. On the asymptotic solution of a special type recurrence relations and the Kullmann–Luckhardt's technology
    
    Prikl. Diskr. Mat., 2013, no. 4(22),  56–66
11. Asymptotic solution of the recurrence relations in the analysis of splitting algorithms for SAT
    
    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  112–116
12. The clique minimal separator decomposition of a hypergraph
    
    J. Sib. Fed. Univ. Math. Phys., 5:1 (2012),  36–45
13. FPT-algorithms on graphs of limited treewidth
    
    Prikl. Diskr. Mat., 2012, no. 2(16),  65–78
14. Methods for designing FPT-algorithms on graphs of limited treewidth
    
    Prikl. Diskr. Mat. Suppl., 2012, no. 5,  102–104
15. Analysis parameterized algorithms on the bases of elasticity to functions complexity
    
    J. Sib. Fed. Univ. Math. Phys., 4:2 (2011),  195–207
16. Computational aspects of treewidth for graph
    
    Prikl. Diskr. Mat., 2011, no. supplement № 4,  85–87
17. FPT-algorithms and their classification on the base of elasticity
    
    Prikl. Diskr. Mat., 2011, no. supplement № 4,  58–60
18. Computational aspects of treewidth for graph
    
    Prikl. Diskr. Mat., 2011, no. 3(13),  65–79
19. FPT-algorithms and their classification on the basis of elasticity
    
    Prikl. Diskr. Mat., 2011, no. 2(12),  40–48
20. Elasticity of algorithms
    
    Prikl. Diskr. Mat., 2010, no. supplement № 3,  76–78
21. Elasticity of algorithms
    
    Prikl. Diskr. Mat., 2010, no. 2(8),  87–95
22. Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
    
    J. Sib. Fed. Univ. Math. Phys., 2:1 (2009),  48–62
23. Mathematical Methods for the Analysis of Recursive Algorithms
    
    J. Sib. Fed. Univ. Math. Phys., 1:3 (2008),  236–246