Dr. Wensheng Luo

College of Computer Science and Engineering, Hunan University

Email: luowensheng@hnu.edu.cn
Office: National Supercomputing Center in Changsha, Hunan University, 252 Lushan South Road, Yuelu District, Changsha, China

Biography

I am currently an Assistant Professor in the College of Computer Science and Engineering at Hunan University. Prior to this, I was a Postdoctoral Fellow in the School of Data Science at the Chinese University of Hong Kong, Shenzhen (CUHK-SZ), working with Prof. Yixiang Fang. During my time there, I also had the privilege of collaborating with Prof. Chenhao Ma and the highly talented PhD candidate Yingli Zhou.

Research Interests

My general research interests mainly focus on the areas of data management, data mining, and artificial intelligence over big data, particularly big graph data. Currently, I am working on the following research topics:

  • Graph data: cohesive subgraph search, subgraph maintenance
  • Parallel computing: cohesive subgraph decomposition, matrix multiplication

Publications

[Google scholar]

  1. Wensheng Luo, Yixiang Fang, Chunxu Lin, Yingli Zhou. "Efficient Parallel D-core Decomposition at Scale", Proceedings of the VLDB Endowment (PVLDB), 2024.
  2. Chunxu Lin, Wensheng Luo*, Yixiang Fang, Chenhao Ma, Xilin Liu, Yuchi Ma. "On Efficient Large Sparse Matrix Chain Multiplication", ACM International Conference on Management of Data (SIGMOD), 2024.
  3. Yuan Xie, Fan Wu, Xu Zhou, Wensheng Luo, Yifang Yin, Roger Zimmermann, Keqin Li, Kenli Li. "Trajectory-Aware Task Coalition Assignment in Spatial Crowdsourcing (Extended Abstract)", IEEE International Conference on Data Engineering (ICDE), 2024.
  4. Yuan Xie, Fan Wu, Xu Zhou, Wensheng Luo, Yifang Yin, Roger Zimmermann, Keqin Li, Kenli Li. "Trajectory-aware Task Coalition Assignment in Spatial Crowdsourcing", IEEE Transactions on Knowledge and Data Engineering (TKDE), 2024.
  5. Wensheng Luo, Qiaoyuan Yang, Yixiang Fang, Xu Zhou. "Efficient Core Maintenance in Large Bipartite Graphs", ACM International Conference on Management of Data (SIGMOD), 2024.
  6. Haoxuan Xie, Yixiang Fang, Yuyang Xia, Wensheng Luo, Chenhao Ma. "On Querying Spanned Connected Components in Large Temporal Graphs", ACM International Conference on Management of Data (SIGMOD), 170:1-170:27, 2023.
  7. Yingli Zhou, Yixiang Fang, Wensheng Luo, Yunming Ye. "Influential Community Search over Large Heterogeneous Information Networks", Proceedings of the VLDB Endowment (PVLDB), 16(8): 2047-2060, 2023.
  8. Wensheng Luo, Zhuo Tang, Yixiang Fang, Chenhao Ma, Xu Zhou. "Scalable Algorithms for Densest Subgraph Discovery", IEEE International Conference on Data Engineering (ICDE), 287-300, 2023.
  9. Wensheng Luo, Xu Zhou, Kenli Li, Yunjun Gao, Keqin Li. "Efficient Influential Community Search in Large Uncertain Graphs.", IEEE Transactions on Knowledge and Data Engineering (TKDE), 35(4): 3779-3793, 2023.
  10. Yixiang Fang, Wensheng Luo, Chenhao Ma. "Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques", Proceedings of the VLDB Endowment (PVLDB), 15(12): 3766-3769, 2022.
  11. Wensheng Luo, Kenli Li, Xu Zhou, Yunjun Gao, Keqin Li. "Maximum Biplex Search over Bipartite Graphs", IEEE International Conference on Data Engineering (ICDE), 898-910, 2022.
  12. Peiying Lin, Yangfan Li, Wensheng Luo, Xu Zhou, Yuanyuan Zeng, Kenli Li, Keqin Li. "Personalized query techniques in graphs: A survey", Information Sciences, 607: 961-1000, 2022.
  13. Yuanyuan Zeng, Kenli Li, Xu Zhou, Wensheng Luo, Yunjun Gao. "An Efficient Index-Based Approach to Distributed Set Reachability on Small-World Graphs", IEEE Transactions on Parallel and Distributed Systems (TPDS), 33(10): 2358-2371, 2022.
  14. ZhiBang Yang, Xiaoxue Li, Xu Zhang, Wensheng Luo, Kenli Li. "K-truss community most favorites query based on top-t", World Wide Web, 25(2): 949-969, 2022.
  15. Wensheng Luo, Xu Zhou, Jianye Yang, Peng Peng, Guoqing Xiao, Yunjun Gao. "Efficient Approaches to Top-r Influential Community Search", IEEE Internet of Things Journal, 8(16): 12650-12657, 2021.

Academia Services