Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Il'ev, Viktor Petrovich
Statistics Math-Net.Ru
Total publications: 23
Scientific articles: 23
Talks: 1

Number of views:
This page:1905
Abstract pages:12358
Full texts:5968
Talk pages:1029
Associate professor
Doctor of physico-mathematical sciences (1989)
Birth date: 1956
E-mail: , ,
Website: https://www.univer.omsk.su/departs/math/cpivm/staff/ilev/

https://www.mathnet.ru/eng/person27788
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/222784
https://elibrary.ru/author_items.asp?authorid=10395

Publications in Math-Net.Ru Citations
2025
1. V. P. Il'ev, A. V. Morshinin, “Characterization of hereditary systems and comatroids in terms of rank and girth functions”, Sib. Èlektron. Mat. Izv., 22:1 (2025),  692–700  mathnet
2024
2. V. P. Il'ev, S. D. Il'eva, A. V. Kononov, “Approximation algorithms for graph clustering problems with clusters of bounded size”, Diskretn. Anal. Issled. Oper., 31:4 (2024),  40–57  mathnet; J. Appl. Industr. Math., 18:4 (2024), 686–696
2023
3. 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  mathnet 2
2021
4. 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  mathnet  elib 4
2020
5. 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  mathnet; J. Appl. Industr. Math., 14:3 (2020), 490–502  scopus 2
6. 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  mathnet 1
2019
7. 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  mathnet 1
2018
8. A. V. Ilev, V. P. Il'ev, “On a semi-superwized graph clustering problem”, Prikl. Diskr. Mat., 2018, no. 42,  66–75  mathnet  elib 3
2016
9. 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  mathnet  mathscinet  elib; J. Appl. Industr. Math., 10:3 (2016), 341–348  scopus 6
10. 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  mathnet
11. 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  mathnet  elib; Comput. Math. Math. Phys., 56:9 (2016), 1591–1597  isi  scopus 2
2013
12. 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  mathnet
2011
13. 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  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 5:4 (2011), 569–581  scopus 8
14. 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  mathnet 1
15. 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  mathnet 4
2010
16. 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  mathnet 1
2009
17. V. P. Ilyev, “Problems on independence systems solvable by the greedy algorithm”, Diskr. Mat., 21:4 (2009),  85–94  mathnet  mathscinet  elib; Discrete Math. Appl., 19:5 (2009), 515–522  scopus 3
2008
18. V. P. Il'ev, “Оценки погрешности жадных алгоритмов для задач на наследственных системах”, Diskretn. Anal. Issled. Oper., 15:1 (2008),  44–57  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 3:1 (2009), 68–77  scopus
2006
19. 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  mathnet  mathscinet  zmath; J. Appl. Industr. Math., 1:1 (2007), 1–8  scopus 35
2003
20. V. P. Il'ev, A. S. Televnin, “Two problems on hereditary systems”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003),  54–66  mathnet  mathscinet  zmath
1998
21. 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  mathnet  mathscinet  zmath 1
1996
22. V. P. Il'ev, “An error estimate for a gradient algorithm for independence systems”, Diskretn. Anal. Issled. Oper., 3:1 (1996),  9–22  mathnet  mathscinet  zmath 1
1982
23. 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  mathnet  mathscinet  zmath 10

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
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026