activity
20042017
most citedA sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

14 citations · 32 across the 5 of their papers we have counts for

collaborators
Showing 2004 · math.PRShow all

Nothing from them under that filter.

Their other years and fields are still on the left.