Estimating end-to-end delays under changing conditions. - Philippe Nain; Don Towsley; Amotz Bar-Noy; Prithwish Basu; Matthew P. Johnson 001; Feng Yu 005 (CHANTS@MobiCom, 2013)

Algorithms for channel assignment in mobile wireless networks using temporal coloring. - Feng Yu 005; Amotz Bar-Noy; Prithwish Basu; Ram Ramanathan (MSWiM, 2013)

Computing Traversal Times on Dynamic Markovian Paths - Philippe Nain; Don Towsley; Matthew P. Johnson 001; Prithwish Basu; Amotz Bar-Noy; Feng Yu 005 (CoRR, 2013)

Low Expected Latency Routing in Dynamic Networks. - Prithwish Basu; Feng Yu 005; Matthew P. Johnson 001; Amotz Bar-Noy (MASS, 2014)

To Sample or To Smash? Estimating reachability in large time-varying graphs. - Prithwish Basu; Feng Yu 005; Amotz Bar-Noy; Dror Rawitz (SDM, 2014)

An efficient alternative to Ollivier-Ricci curvature based on the Jaccard metric. - Siddharth Pal; Feng Yu 005; Terrence J. Moore; Ram Ramanathan; Amotz Bar-Noy; Ananthram Swami (CoRR, 2017)

Quantifying the Strength of the Friendship Paradox. - Siddharth Pal; Feng Yu 005; Yitzchak Novick; Ananthram Swami; Amotz Bar-Noy (COMPLEX NETWORKS (2), 2018)

A study on the friendship paradox - quantitative analysis and relationship with assortative mixing. - Siddharth Pal; Feng Yu 005; Yitzchak Novick; Ananthram Swami; Amotz Bar-Noy (Appl. Netw. Sci., 2019)