Associate Researcher, Microsoft Research Asia.
|
 |
Biography
Yajun Wang received his PhD degree from the Hong Kong University of Science and Technology in 2008. Before that, he obtained his B.E of computer science from University of Science and Technology of China. Yajun joined the theory group of Microsoft Research Asia in 2008
Recent Publication
Tighter Bounds for Facility Games
with Pinyan Lu and Yuan Zhou [pdf] to appear in The fifth Workshop on Internet & Network Economics (WINE 2009)
Approximate Homotopic Shortest Paths in Anisotropic Regions
with Siu-Wing Cheng, Jiongxin Jin, and Antoine Vigneron [pdf] (Submitted)
Querying Approximate Shortest Paths in Anisotropic Regions
with Siu-Wing Cheng, Hyeon-Suk Na, and Antoine Vigneron [pdf] accepted for publication in SIAM Journal on Computing (SICOMP) A preliminary version appeared in SoCG 2007
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
with Wei Chen, Shang-Hua Teng, and Yuan Zhou [pdf] The Third International Frontiers of Algorithmics Workshop (FAW 2009)
Efficient Influence Maximization in Social Networks
with Wei Chen and Siyu Yang [pdf] The 15th ACM SIGKDD Conference on Knoledge Discovery and Data Mining (KDD 2009)
Download: data is available uopn request.
On Approximate Distance Oracles for Power Law Graphs
with Wei Chen, Christian Sommer, and Shang-Hua Teng [pdf] The 23rd International Symposium on Distributed Computing (DISC 2009)
Random Deployment of Wireless Sensor Networks: Power of Second Chance
Xiang-Yang Li, Yajun Wang, and Wangsen Feng [pdf] The 15th International Computing and Combinatorics Conference (COCOON 2009)
Disclaimers: The materials beblow are provided by the author(s) for the purpose of timely dissemination of scholarly work on academic research basis. Copyrights and all rights are retained by the authors or by other copyright holders. These materials may not be reposted without explicit permission of the copyright holders.
