Back to authors
Yingli Zhou
- Author ID
- o0009-0008-5630-6822
- ORCID
-
0009-0008-5630-6822
- Links
-
(found by gpt-5.6-luna on aug 28 2026)
- Most Frequent Institution
- Chinese University of Hong Kong
- Pagerank
- 0.1587889
- Overall Rank
- 392 | 98.20%
- Paper Count
- 22
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 22 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 3,286 |
In-depth Analysis of Graph-based RAG in a Unified Framework |
2025 |
VLDB |
11 |
7.441688e-05 |
| 4,595 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
19 |
6.4993083e-05 |
| 6,666 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5 |
5.698709e-05 |
| 7,832 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
12 |
5.4289543e-05 |
| 8,187 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
10 |
5.3652509e-05 |
| 10,141 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
2 |
5.0597449e-05 |
| 10,257 |
PRICE: A Pretrained Model for Cross-Database Cardinality Estimation |
2025 |
VLDB |
1 |
5.039379e-05 |
| 10,394 |
Effective Structurally Similar Community Search in Large Temporal Graphs |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,520 |
Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,543 |
HAMMER: An Automatic RAG Tuning System via Hierarchical Memory-Guided Monte Carlo Tree Search |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,636 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
3 |
4.9605343e-05 |
| 10,708 |
Efficient Influential Community Search over Dynamic Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,762 |
The Case For Language Model Approximated LIKE Predicate |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,779 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,783 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,862 |
BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents |
2026 |
VLDB |
1 |
4.9605343e-05 |
| 10,879 |
Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,099 |
Graph-Based Retrieval-Augmented Generation: Applications, Challenges, Solutions, and Opportunities |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,115 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,284 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4 |
4.9605343e-05 |
| 11,383 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
3 |
4.9605343e-05 |
| 11,441 |
Streaming View: An Efficient Data Processing Engine for Modern Real-time Data Warehouse of Alibaba Cloud |
2025 |
VLDB |
1 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.