Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs. - Bo Wu 010; Haiying Shen (ICCCN, 2015)

Exploiting Active Sub-Areas for Multi-Copy Routing in VDTNs. - Bo Wu 010; Haiying Shen; Kang Chen (ICCCN, 2015)

A time-efficient connected densest subgraph discovery algorithm for big data. - Bo Wu 010; Haiying Shen (NAS, 2015)

Analyzing and predicting news popularity on Twitter. - Bo Wu 010; Haiying Shen (Int. J. Inf. Manag., 2015)

DIAL: A Distributed Adaptive-Learning Routing Method in VDTNs. - Bo Wu 010; Haiying Shen; Kang Chen (IoTDI, 2016)

Corrigendum to "Analyzing and predicting news popularity on Twitter" [Int. J. Inf. Manage. 35 (6) (2015) 702-711] - Bo Wu 010; Haiying Shen (Int. J. Inf. Manag., 2016)

SPread: Exploiting fractal social community For efficient multi-coPy routing in VDTNs. - Bo Wu 010; Kang Chen; Haiying Shen (ICNC, 2017)

Exploiting Efficient Densest Subgraph Discovering Methods for Big Data. - Bo Wu 010; Haiying Shen (IEEE Trans. Big Data, 2017)

Exploiting Active Subareas for Multicopy Routing in VDTNs. - Bo Wu 010; Haiying Shen; Kang Chen (IEEE Trans. Veh. Technol., 2018)

Distributed Vehicle Trajectory Tracking for Efficient Routing in VDTNs. - Bo Wu 010; Haiying Shen (ICCCN, 2019)

SPread: Exploiting Fractal Social Community for Efficient Multi-Copy Routing in Taxi VDTNs. - Bo Wu 010; Haiying Shen; Kang Chen (IEEE Trans. Netw. Sci. Eng., 2019)