2 citations · 2 across the 2 of their papers we have counts for
3 papers
Dota Underlords game is NP-complete
Alexander A. Ponomarenko, Dmitry V. Sirotkin
In this paper, we demonstrate how the problem of the optimal team choice in the popular computer game Dota Underlords can be reduced to the problem of linear integer programming. W…
Overlapping community detection in networks based on link partitioning and partitioning around medoids
Alexander Ponomarenko, Leonidas Pitsoulis, Marat Shamshetdinov
In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids). The ov…
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn
One of the approaches for the nearest neighbor search problem is to build a network which nodes correspond to the given set of indexed objects. In this case the search of the close…