| |
Bykova Valentina Vladimirovna
|
| Statistics Math-Net.Ru |
| Total publications: |
21 |
| Scientific articles: |
21 |
| Number of views: |
| This page: | 1276 | | Abstract pages: | 4892 | | Full texts: | 2077 | | References: | 1079 |
|
|
Professor |
|
Doctor of physico-mathematical sciences |
| E-mail: |
|
|
 |
http://www.mathnet.ru/eng/person41903 |
 |
List of publications on Google Scholar |
 |
List of publications on ZentralBlatt |
 |
http://elibrary.ru/author_items.asp?spin=9875-5062
|
 |
http://www.scopus.com/authid/detail.url?authorId=55129668200
|
|
| Publications in Math-Net.Ru |
| 1. |
On algebraic approach of R. Wille and B. Ganter in the investigation of texts
Valentina V. Bykova, Choduraa M. Mongush
J. Sib. Fed. Univ. Math. Phys., 10:3 (2017), 372–384 |
| 2. |
Optimal routing by landmarks in the time-dependent networks
V. V. Bykova, A. A. Soldatenko
Prikl. Diskr. Mat., 2017, no. 37, 114–123 |
| 3. |
On the non-redundant representation of the minimax basis of strong associations
V. V. Bykova, A. V. Kataeva
Prikl. Diskr. Mat., 2017, no. 36, 113–126 |
| 4. |
Algorithm for constructing a non-redundant minimax basis of strong associative rules
V. V. Bykova, A. V. Kataeva
Prikl. Diskr. Mat. Suppl., 2017, no. 10, 154–157 |
| 5. |
Calculation of upper bounds for graph vertex integrity based on the minimal separators
V. V. Bykova, Y. I. Kirillov
Prikl. Diskr. Mat. Suppl., 2015, no. 8, 142–144 |
| 6. |
Measures for graph integrity: a comparative survey
V. V. Bykova
Prikl. Diskr. Mat., 2014, no. 4(26), 96–111 |
| 7. |
Structural decomposition of graphs and its application for solving optimization problems on sparse graphs
V. V. Bykova
Prikl. Diskr. Mat. Suppl., 2014, no. 7, 154–157 |
| 8. |
On the asymptotic solution of a special type recurrence relations and the Kullmann–Luckhardt's technology
V. V. Bykova
Prikl. Diskr. Mat., 2013, no. 4(22), 56–66 |
| 9. |
Asymptotic solution of the recurrence relations in the analysis of splitting algorithms for SAT
V. V. Bykova
Prikl. Diskr. Mat. Suppl., 2013, no. 6, 112–116 |
| 10. |
The clique minimal separator decomposition of a hypergraph
Valentina V. Bykova
J. Sib. Fed. Univ. Math. Phys., 5:1 (2012), 36–45 |
| 11. |
FPT-algorithms on graphs of limited treewidth
V. V. Bykova
Prikl. Diskr. Mat., 2012, no. 2(16), 65–78 |
| 12. |
Methods for designing FPT-algorithms on graphs of limited treewidth
V. V. Bykova
Prikl. Diskr. Mat. Suppl., 2012, no. 5, 102–104 |
| 13. |
Analysis parameterized algorithms on the bases of elasticity to functions complexity
Valentina V. Bykova
J. Sib. Fed. Univ. Math. Phys., 4:2 (2011), 195–207 |
| 14. |
Computational aspects of treewidth for graph
V. V. Bykova
Prikl. Diskr. Mat., 2011, no. supplement № 4, 85–87 |
| 15. |
FPT-algorithms and their classification on the base of elasticity
V. V. Bykova
Prikl. Diskr. Mat., 2011, no. supplement № 4, 58–60 |
| 16. |
Computational aspects of treewidth for graph
V. V. Bykova
Prikl. Diskr. Mat., 2011, no. 3(13), 65–79 |
| 17. |
FPT-algorithms and their classification on the basis of elasticity
V. V. Bykova
Prikl. Diskr. Mat., 2011, no. 2(12), 40–48 |
| 18. |
Elasticity of algorithms
V. V. Bykova
Prikl. Diskr. Mat., 2010, no. supplement № 3, 76–78 |
| 19. |
Elasticity of algorithms
V. V. Bykova
Prikl. Diskr. Mat., 2010, no. 2(8), 87–95 |
| 20. |
Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
Valentina V. Bykova
J. Sib. Fed. Univ. Math. Phys., 2:1 (2009), 48–62 |
| 21. |
Mathematical Methods for the Analysis of Recursive Algorithms
Valentina V. Bykova
J. Sib. Fed. Univ. Math. Phys., 1:3 (2008), 236–246 |
|
|
| Organisations |
|
| |
|
|
Terms of Use