Back to authors
Wensheng Luo
- Author ID
- 24130
- ORCID
-
-
- Links
-
(found by gpt-5.2 on mar 13 2026)
- Most Frequent Institution
- Chinese Univerity of Hong Kong
- Pagerank
- 0.074805607
- Overall Rank
- 881 | 95.85%
- 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,970 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
5.7945079e-05 |
| 5,610 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
5.4118541e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,513 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5.0321577e-05 |
| 9,228 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
4.3690661e-05 |
| 9,670 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
4.3066148e-05 |
| 10,189 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,240 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
4.1945683e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,553 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.