Back to authors
Wensheng Luo
- Author ID
- 24134
- ORCID
-
-
- Links
-
(found by gpt-5.2 on mar 13 2026)
- Most Frequent Institution
- Chinese Univerity of Hong Kong
- Pagerank
- 0.082356791
- Overall Rank
- 848 | 95.94%
- Paper Count
- 11
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 11 of 11 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 4,236 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
6.8787462e-05 |
| 5,036 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
6.45867e-05 |
| 6,062 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0525723e-05 |
| 6,514 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.9114568e-05 |
| 9,241 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
5.3572577e-05 |
| 9,657 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
5.2976492e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
5.1725247e-05 |
| 10,240 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
5.1725247e-05 |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
5.1725247e-05 |
| 10,562 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
5.1725247e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
5.1725247e-05 |
Frequent Co-authors
Co-authored at least 5 papers.