13 citations · 14 across the 3 of their papers we have counts for
3 papers
Scalable Betweenness Centrality Maximization via Sampling
Ahmad Mahmoody, Charalampos E. Tsourakakis, Eli Upfal
Betweenness centrality is a fundamental centrality measure in social network analysis. Given a large-scale network, how can we find the most central nodes? This question is of key…
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection
Ahmad Mahmoody, Evgenios M. Kornaropoulos, Eli Upfal
We formulate and study a fundamental search and detection problem, Schedule Optimization, motivated by a variety of real-world applications, ranging from monitoring content changes…
Wiggins: Detecting Valuable Information in Dynamic Networks Using Limited Resources
Ahmad Mahmoody, Matteo Riondato, Eli Upfal
Detecting new information and events in a dynamic network by probing individual nodes has many practical applications: discovering new webpages, analyzing influence properties in n…