| 696 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
51 |
0.00014671367 |
| 1,405 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
34 |
0.00010745719 |
| 1,590 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
41 |
0.00010110798 |
| 1,995 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
40 |
9.2189157e-05 |
| 3,286 |
In-depth Analysis of Graph-based RAG in a Unified Framework |
2025 |
VLDB |
11 |
7.441688e-05 |
| 3,778 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0037629e-05 |
| 3,881 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
11 |
6.9309694e-05 |
| 3,928 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
13 |
6.9013791e-05 |
| 4,057 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
12 |
6.8140795e-05 |
| 4,595 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
19 |
6.4993083e-05 |
| 4,944 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
21 |
6.3297928e-05 |
| 4,973 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
8 |
6.3201026e-05 |
| 5,643 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
8 |
6.0363665e-05 |
| 5,663 |
Walking in the Cloud: Parallel SimRank at Scale |
2016 |
VLDB |
7 |
6.0296053e-05 |
| 6,666 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5 |
5.698709e-05 |
| 7,081 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
5 |
5.5894444e-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 |
| 8,219 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
6 |
5.359172e-05 |
| 8,416 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
8 |
5.3208725e-05 |
| 8,670 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
2 |
5.2754888e-05 |
| 9,004 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
8 |
5.2256037e-05 |
| 9,223 |
Interactive Graph Search for Multiple Targets on DAGs |
2025 |
VLDB |
2 |
5.1913816e-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,141 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
2 |
5.0597449e-05 |
| 10,290 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.031399e-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,737 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
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,315 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
1 |
4.9605343e-05 |
| 11,321 |
ACE: A Cardinality Estimator for Set-Valued Queries |
2025 |
VLDB |
0 |
4.9605343e-05 |
| 11,383 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
3 |
4.9605343e-05 |
| 11,634 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
2 |
4.9605343e-05 |
| 11,966 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9605343e-05 |