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.081500438
- Overall Rank
- 884 | 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,928 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
13 |
6.9013791e-05 |
| 4,595 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
19 |
6.4993083e-05 |
| 5,643 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
8 |
6.0363665e-05 |
| 6,666 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5 |
5.698709e-05 |
| 8,670 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
2 |
5.2754888e-05 |
| 9,336 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
2 |
5.1783355e-05 |
| 9,985 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
2 |
5.0849662e-05 |
| 10,290 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.031399e-05 |
| 10,737 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,783 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,966 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.
| Co-author |
Shared Papers |
Rank |
Pagerank |
|
Yixiang Fang
|
11 |
135 |
0.33781711 |