Alexander A. Ganin

EngineeringComputer SciencePhysics and Astronomy

Pilot corpus only

This score is computed over theSindex pilot corpus and does not cover the full scientific literature. Scores are relative to papers we have ingested — papers, authors, and institutions outside the pilot are not represented. Methodology.

Top 100%percentile

0Author DataRank

Indexed papers

0in pilot corpus

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Papers

Driven by 1 paper. Top paper: “Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping”.

Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping

Nature Communications(2023)10.1038/s41467-022-35181-w

N/A

0DataRank · unranked

18 citations

Alexander A. Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David Alderson +3 more