Статьи в журналах/сборниках из перечня Web of Science/Scopus |
| 1 | Ивашкин В.С., Чеботарев П.Ю. Do logarithmic proximity measures outperform plain ones in graph clustering? // Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics. 2017. 197. С. 87-105. | 2017 |
Статьи в журналах/сборниках |
| 2 | Ивашкин В.С., Чеботарев П.Ю. Do logarithmic proximity measures outperform plain ones in graph clustering? / arXiv.org. Ithaca: Cornell University, 2016. cs.LG/1605. С. https://arxiv.org/abs/1605.01046. | 2016 |
Пленарные доклады и доклады из перечня Web of Science/Scopus |
| 3 | Ивашкин В.С., Чеботарев П.Ю. Dissecting Graph Measure Performance for Node Clustering in LFR Parameter Space / Proceedings of the 10th International Conference on Complex Networks and their Applications (Madrid, 2021). Cham: Springer, 2022. V. 1. С. 328-341. | 2022 |
Тезисы докладов |
| 4 | Чеботарев П.Ю., Ивашкин В.С. Logarithmic proximity measures outperform plain ones in graph nodes clustering / Abstract Book of the 6th International Conference on Network Analysis (Nizhny Novgorod, Russia, 2016). Nizhny Novgorod: NRU Higher School of Economics, 2016. С. 8. | 2016 |
