Science activity
Articles (4) More info
| 1 |
Il’ev A.
, Il’ev V.
Clustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem In compilation Mathematical Optimization Theory and Operations Research : 23rd International Conference, MOTOR 2024, Omsk, Russia, June 30–July 6, 2024, Proceedings. – Springer Cham., 2024. – C.103-115. – ISBN 978-3-031-62792-7. DOI: 10.1007/978-3-031-62792-7_7 Scopus OpenAlex |
| 2 |
Il’ev A.V.
, Il’ev V.P.
Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size Journal of Mathematical Sciences (United States). 2023. V.275. N1. P.78-84. DOI: 10.1007/s10958-023-06661-1 Scopus РИНЦ OpenAlex |
| 3 |
Il'Ev A.V.
, Il'Ev V.P.
ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS [АЛГОРИТМЫ РЕШЕНИЯ СИСТЕМ УРАВНЕНИЙ НАД РАЗЛИЧНЫМИ КЛАССАМИ КОНЕЧНЫХ ГРАФОВ] Прикладная дискретная математика (Prikladnaya Diskretnaya Matematika). 2021. N53. P.89-102. DOI: 10.17223/20710410/53/6 WOS Scopus OpenAlex |
| 4 |
Il'ev A.V.
, Il'ev V.P.
On axiomatizability and decidability of universal theories of hereditary classes of matroids In compilation XII International scientific and technical conference "Applied Mechanics and Systems Dynamics" 13–15 November 2018, Omsk, Russian Federation. – IOP Publishing Ltd., 2019. DOI: 10.1088/1742-6596/1210/1/012056 Scopus OpenAlex |
Conference attendances (1) More info
| 1 |
Il’ev A.
, Il’ev V.
Сlustering Complexity and an Approximation Algorithm for a Version of the Cluster Editing Problem XXIII International Conference Mathematical Optimization Theory and Operations Research 30 Jun - 6 Jul 2024 |