• Efficient influence maximization in social networks (with Yajun Wang and Siyu Yang). We study new algorithms and heuristics to improve the speed of finding influential nodes in a social network.

  - Publications:[KDD'09]
  - Data: [data for two collaboration graphs NetHEPT and NetPHY]

• Bounded budget betweenness centrality game (with Xiaohui Bei, Shang-Hua Teng, Jialin Zhang, and Jiajie Zhu). We study a strategic network formation game in which nodes strategically select connections to other nodes to maximize their betweenness centralities in the network.

- Publications: [ESA'09][MSR-TR-2008-167][MSR-TR-2009-78]

• Approximate distance oracles and compact routing schemes for random power-law networks (with Christian Sommer, Shang-Hua Teng, and Yajun Wang). Based on the random power-law graph model, we adapt Thorup and Zwick's scheme on approximate distance oracles and prove that our adaptation improves both the oracle size and the preprocessing time of the original scheme. We also derive a compact routing scheme with a smaller routing table sizefrom our distance oracle for the random power-law networks.

- Publications: [DISC'09][MSR-TR-2009-84]

• Isolation game (with Shang-Hua Teng and Yingchao Zhao). We study a class of games in which players select locations in a space in order to maximize their distances to other players in the space.

- Publications: [ISAAC'08][MSR-TR-2008-126]