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