activity
20152026
most citedGrowing homophilic networks are natural navigable small worlds

9 citations · 12 across the 8 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2026

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph

Alexander Ponomarenko

We analyze greedy routing in a random graph G_n constructed on the vertex set V = {1, 2, ..., n} embedded in Z. Vertices are inserted according to a uniform random permutation pi,…

math.CO2020★ 2 cited

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…