Wensheng Luo

Orcid: 0000-0002-1463-814X

Affiliations:
  • Hunan University, College of Computer Science and Electronic Engineering, Changsha, China
  • National Supercomputing Center, Changsha, Hunan, China


According to our database1, Wensheng Luo authored at least 12 papers between 2021 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Efficient Core Maintenance in Large Bipartite Graphs.
Proc. ACM Manag. Data, September, 2023

Efficient Influential Community Search in Large Uncertain Graphs.
IEEE Trans. Knowl. Data Eng., April, 2023

Influential Community Search over Large Heterogeneous Information Networks.
Proc. VLDB Endow., 2023

On Querying Connected Components in Large Temporal Graphs.
Proc. ACM Manag. Data, 2023

A Survey of Densest Subgraph Discovery on Large Graphs.
CoRR, 2023

Scalable Algorithms for Densest Subgraph Discovery.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
K-truss community most favorites query based on top-t.
World Wide Web, 2022

An Efficient Index-Based Approach to Distributed Set Reachability on Small-World Graphs.
IEEE Trans. Parallel Distributed Syst., 2022

Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques.
Proc. VLDB Endow., 2022

Personalized query techniques in graphs: A survey.
Inf. Sci., 2022

Maximum Biplex Search over Bipartite Graphs.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021
Efficient Approaches to Top-r Influential Community Search.
IEEE Internet Things J., 2021


  Loading...