Science activity

Articles (10) 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 V.P. , Il’eva S. Approximation Algorithms for Graph Cluster Editing Problems with Cluster Size at Most 3 and 4 In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2023. – Т.1881. – C.134-145. DOI: 10.1007/978-3-031-43257-6_11 Scopus OpenAlex
3	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
4	Kononov A. , Il’ev V. On Cluster Editing Problem with Clusters of Small Sizes In compilation Optimization and Applications : 14th International Conference, OPTIMA 2023, Petrovac, Montenegro, September 18–22, 2023, Revised Selected Papers. – Springer., 2023. – C.316-328. – ISBN 9783031478598. DOI: 10.1007/978-3-031-47859-8_23 Scopus OpenAlex
5	Il’ev V. , Il’eva S. , Gorbunov N. An Approximation Algorithm for Graph Clustering with Clusters of Bounded Sizes Communications in Computer and Information Science. 2022. V.1661 CCIS. P.68-75. DOI: 10.1007/978-3-031-16224-4_4 Scopus OpenAlex
6	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
7	Il'ev V.P. , Morshinin A.V. , Ileva S.D. 2-Approximation Algorithms for Two Graph Clustering Problems Journal of Applied and Industrial Mathematics. 2020. N14. P.490-502. DOI: 10.1134/S1990478920030084 Scopus OpenAlex
8	Il'ev V. , Il’eva S. , Morshinin A. A 2-Approximation Algorithm for the Graph 2-Clustering Problem In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.295-308. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_21 Scopus РИНЦ OpenAlex
9	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
10	Ageev A.A. , Il’ev V.P. , Kononov A.V. , Talevnin A.S. Computational complexity of the graph approximation problem Journal of Applied and Industrial Mathematics. 2007. V.1. N1. P.1-8. DOI: 10.1134/s1990478907010012 Scopus OpenAlex

Conference theses (1) More info

1

Ilʹev V.P. , Il’eva S. , Morshinin A.V. An Approximation Algorithm for a Semi-Supervised Graph Clustering Problem In compilation International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2020: Mathematical Optimization Theory and Operations Research. 2020. – Т.1275. – C.23-29.

Conference attendances (4) 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
2	Morshinin A. , Il'ev V. Exact algorithms for various graph clustering problems Mathematical optimization theory and operations research (MOTOR-2021) 05-10 Jul 2021
3	Il'ev V. , Il'Eva S. , Morshinin A. An Approximation Algorithm for a Semi-Supervised Graph Clustering Problem Mathematical Optimization Theory and Operations Research 06-10 Jul 2020
4	Il'ev V. , Il’eva S. , Morshinin A. A 2-approximation algorithm for the graph 2-clustering problem 18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019