A. V. Iliev, “On axiomatizability of hereditary classes of graphs and matroids”, Sib. Èlektron. Mat. Izv., 13 (2016), 137–147
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
A. V. Ilev, “Study of systems of equations over various classes of finite matroids”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 1094–1102
A. Il’ev, V. Il’ev, “Clustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem”, 23rd International Conference “Mathematical Optimization Theory and Operations Research” (Omsk, Russian Federation, June 30–July 6, 2024), Lecture Notes in Computer Science, 14766, Springer–Cham, 2024, 103–115
A. V. Il'ev, “Decidability of universal theories and axiomatizability of hereditary classes of graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 1, 2016, 100–111
2.
A. V. Ilev, V. P. Il'ev, “On a semi-superwized graph clustering problem”, Prikl. Diskr. Mat., 2018, no. 42, 66–75
3.
A. V. Iliev, “On axiomatizability of hereditary classes of graphs and matroids”, Sib. Èlektron. Mat. Izv., 13 (2016), 137–147
4.
A. V. Il’ev, V. P. Il’ev, “Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size”, Journal of Mathematical Sciences, 275 (2023), 78–84
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
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
7.
A. Il’ev, V. Il’ev, “Clustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem”, 23rd International Conference “Mathematical Optimization Theory and Operations Research” (Omsk, Russian Federation, June 30–July 6, 2024), Lecture Notes in Computer Science, 14766, Springer–Cham, 2024, 103–115
8.
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
9.
A. V. Ilev, “Study of systems of equations over various classes of finite matroids”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 1094–1102
10.
A. V. Il’ev, V. P. Il’ev, “On axiomatizability and decidability of universal theories of hereditary classes of matroids”, XII International scientific and technical conference “Applied Mechanics and Systems Dynamics” (Omsk, Russian Federation, November 13–15, 2018), Journal of Physics: Conference Series, 1210, IOP Publishing Ltd, 2019, 012056
11.
A. V. Ilev, V. N. Remeslennikov, “Issledovanie sovmestnosti sistem uravnenii nad grafami i nakhozhdenie ikh obschikh reshenii”, Vestnik Omskogo universiteta, 2017, no. 4(86), 26–32
12.
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
13.
A. V. Ilev, “A Letter to the Editor”, Trudy Inst. Mat. i Mekh. UrO RAN, 24, no. 2, 2018, 298