Back to authors
Wensheng Luo
- Author ID
- u24311
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Chinese University of Hong Kong
- Pagerank
- 0.081512247
- Overall Rank
- 882 | 95.93%
- 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 all 11 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 3,922 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
12 |
6.9205122e-05 |
| 4,780 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
17 |
6.4161407e-05 |
| 5,631 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
8 |
6.0563927e-05 |
| 6,655 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5 |
5.717615e-05 |
| 8,652 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
2 |
5.2929907e-05 |
| 9,874 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
1 |
5.115241e-05 |
| 9,952 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
2 |
5.101836e-05 |
| 10,261 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.0480912e-05 |
| 10,676 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,722 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,922 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9769913e-05 |
Frequent Co-authors
Co-authored at least 5 papers.
| Co-author |
Shared Papers |
Rank |
Pagerank |
|
Yixiang Fang
|
11 |
136 |
0.33787518 |