|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
1. |
R. V. Baldzhanova, A. V. Ilev, V. P. Il'ev, “On the complexity of graph clustering in the problem with bounded cluster sizes”, Prikl. Diskr. Mat., 2023, no. 60, 76–84 |
|
2021 |
2. |
A. V. Il'ev, V. P. Il'ev, “Algorithms for solving systems of equations over various classes of finite graphs”, Prikl. Diskr. Mat., 2021, no. 53, 89–102 |
1
|
|
2020 |
3. |
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin, “$2$-Approximation algorithms for two graph clustering problems”, Diskretn. Anal. Issled. Oper., 27:3 (2020), 88–108 ; J. Appl. Industr. Math., 14:3 (2020), 490–502 |
1
|
4. |
A. V. Il'ev, V. P. Il'ev, “On axiomatizability of the class of finitary matroids and decidability of their universal theory”, Sib. Èlektron. Mat. Izv., 17 (2020), 1730–1740 |
1
|
|
2019 |
5. |
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin, “Approximate algorithms for graph clustering problem”, Prikl. Diskr. Mat., 2019, no. 45, 64–77 |
|
2018 |
6. |
A. V. Ilev, V. P. Il'ev, “On a semi-superwized graph clustering problem”, Prikl. Diskr. Mat., 2018, no. 42, 66–75 |
3
|
|
2016 |
7. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Graph clustering with a constraint on cluster sizes”, Diskretn. Anal. Issled. Oper., 23:3 (2016), 5–20 ; J. Appl. Industr. Math., 10:3 (2016), 341–348 |
5
|
8. |
A. V. Il'ev, V. P. Il'ev, “A characterization of matroids in terms of surfaces”, Prikl. Diskr. Mat., 2016, no. 3(33), 5–15 |
9. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximate solution of the $p$-median minimization problem”, Zh. Vychisl. Mat. Mat. Fiz., 56:9 (2016), 1614–1621 ; Comput. Math. Math. Phys., 56:9 (2016), 1591–1597 |
2
|
|
2013 |
10. |
V. A. Baransky, M. Yu. Vyplov, V. P. Il'ev, “On the problem of maximizing a modular function in the geometric lattice”, Bulletin of Irkutsk State University. Series Mathematics, 6:1 (2013), 2–13 |
|
2011 |
11. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximation algorithms for graph approximation problems”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 41–60 ; J. Appl. Industr. Math., 5:4 (2011), 569–581 |
7
|
12. |
V. A. Baranski, M. Yu. Vyplov, V. P. Il'ev, “Minimizing modular and supermodular functions on $L$-matroids”, Bulletin of Irkutsk State University. Series Mathematics, 4:3 (2011), 42–53 |
1
|
13. |
V. P. Il'ev, A. A. Navrocka, “Computational complexity of the problem of approximation by graphs with connected components of bounded size”, Prikl. Diskr. Mat., 2011, no. 3(13), 80–84 |
3
|
|
2010 |
14. |
V. P. Il'ev, S. D. Il'eva, “Approximation algorithms for approximating graphs with bounded numberof connected components”, Tr. Inst. Mat., 18:1 (2010), 47–52 |
1
|
|
2009 |
15. |
V. P. Ilyev, “Problems on independence systems solvable by the greedy algorithm”, Diskr. Mat., 21:4 (2009), 85–94 ; Discrete Math. Appl., 19:5 (2009), 515–522 |
3
|
|
2008 |
16. |
V. P. Il'ev, “Оценки погрешности жадных алгоритмов для задач на наследственных системах”, Diskretn. Anal. Issled. Oper., 15:1 (2008), 44–57 ; J. Appl. Industr. Math., 3:1 (2009), 68–77 |
|
2006 |
17. |
A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin, “Computational complexity of the graph approximation problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 3–15 ; J. Appl. Industr. Math., 1:1 (2007), 1–8 |
30
|
|
2003 |
18. |
V. P. Il'ev, A. S. Televnin, “Two problems on hereditary systems”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003), 54–66 |
|
1998 |
19. |
V. P. Il'ev, “An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 45–60 |
1
|
|
1996 |
20. |
V. P. Il'ev, “An error estimate for a gradient algorithm for independence systems”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 9–22 |
1
|
|
1982 |
21. |
V. P. Il'ev, G. Sh. Fridman, “On the problem of approximation by graphs with a fixed number of components”, Dokl. Akad. Nauk SSSR, 264:3 (1982), 533–538 |
9
|
|
Presentations in Math-Net.Ru |
1. |
Новые проблемы алгебры и логики. Юбилейное 900-е заседание семинара V. N. Remeslennikov, A. N. Rybalov, A. N. Shevlyakov, D. V. Solomatin, L. M. Martynov, G. A. Noskov, A. V. Treyer, A. N. Zubkov, V. P. Il'ev, V. M. Gichev
Omsk Algebraic Seminar November 12, 2015 16:00
|
|
|
Organisations |
|
|
|
|