| List of scientific publications: |
|
|
Citations (Crossref Cited-By Service + Math-Net.Ru) |
|
|
| 1. |
Morshinin A.V., “Experimental Study of Semi-Supervised Graph 2-Clustering Problem”, Journal of Mathematical Sciences, 275:1 (2023), 107–115 https://link.springer.com/article/10.1007/s10958-023-06663-z   |
| 2. |
A. .V. Morshinin, “Tochnye algoritmy dlya zadach klasterizatsii vershin grafa”, Vestnik Omskogo Universiteta, 26:1 (2021), 23–29  |
| 3. |
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin, “$2$-Approximation algorithms for two graph clustering problems”, J. Appl. Industr. Math., 14:3 (2020), 490–502  |
| 4. |
V. Ilev, S. Ileva, A. Morshinin, “An Approximation Algorithm for a Semi-supervised Graph Clustering Problem”, Mathematical Optimization Theory and Operations Research (MOTOR 2020) (Novosibirsk, 6–10 July 2020), Communications in Computer and Information Science, 1275, 2020, 295–308 |
| 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  |
| 6. |
V. Ilev, S. Ileva, A. Morshinin, “A 2-Approximation Algorithm for the Graph 2-Clustering Problem”, Mathematical Optimization Theory and Operations Research” (MOTOR2019) (Ekaterinburg, 8–12 July 2019), LNCS, 11548, 2019, 23–29
|
2
[x]
|
| 7. |
A. .V. Morshinin, “Ob odnoi zadache klasterizatsii grafa”, Vestnik Omskogo Universiteta, 23:1 (2018), 4–9 |
|
