| 714 |
Effective Community Search for Large Attributed Graphs |
2016 |
VLDB |
50 |
0.00014562182 |
| 1,414 |
Effective Community Search over Large Spatial Graphs |
2017 |
VLDB |
34 |
0.00010732477 |
| 1,664 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
39 |
9.9394611e-05 |
| 2,044 |
Efficient Algorithms for Densest Subgraph Discovery |
2019 |
VLDB |
39 |
9.1373547e-05 |
| 3,467 |
In-depth Analysis of Graph-based RAG in a Unified Framework |
2025 |
VLDB |
10 |
7.2749538e-05 |
| 3,791 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
26 |
7.0158046e-05 |
| 3,875 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
11 |
6.9503439e-05 |
| 3,922 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
12 |
6.9205122e-05 |
| 4,045 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
12 |
6.8302145e-05 |
| 4,780 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
17 |
6.4161407e-05 |
| 4,924 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
21 |
6.3492725e-05 |
| 4,956 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
8 |
6.3381425e-05 |
| 5,631 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
8 |
6.0563927e-05 |
| 5,650 |
Walking in the Cloud: Parallel SimRank at Scale |
2016 |
VLDB |
7 |
6.0495936e-05 |
| 6,655 |
Efficient Parallel D-core Decomposition at Scale |
2024 |
VLDB |
5 |
5.717615e-05 |
| 7,061 |
C-Explorer: Browsing Communities in Large Graphs |
2017 |
VLDB |
5 |
5.6079878e-05 |
| 7,814 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
11 |
5.4469653e-05 |
| 8,185 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
9 |
5.3801229e-05 |
| 8,204 |
WISK: A Workload-aware Learned Index for Spatial Keyword Queries |
2023 |
SIGMOD |
6 |
5.3769515e-05 |
| 8,397 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
8 |
5.3385249e-05 |
| 8,652 |
Efficiently Counting Triangles in Large Temporal Graphs |
2025 |
SIGMOD |
2 |
5.2929907e-05 |
| 8,983 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
8 |
5.2429402e-05 |
| 9,200 |
Interactive Graph Search for Multiple Targets on DAGs |
2025 |
VLDB |
2 |
5.2086045e-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,106 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
2 |
5.0765311e-05 |
| 10,261 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
2 |
5.0480912e-05 |
| 10,454 |
Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,477 |
HAMMER: An Automatic RAG Tuning System via Hierarchical Memory-Guided Monte Carlo Tree Search |
2026 |
SIGMOD |
1 |
4.9769913e-05 |
| 10,573 |
Efficient and Scalable Directed Densest Subgraph Discovery |
2026 |
SIGMOD |
3 |
4.9769913e-05 |
| 10,647 |
Efficient Influential Community Search over Dynamic Graphs |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,676 |
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs |
2026 |
SIGMOD |
0 |
4.9769913e-05 |
| 10,718 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,722 |
Effective Durable Community Search in Large Temporal Graph |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 10,801 |
BookRAG: A Hierarchical Structure-aware Index-based Approach for Retrieval-Augmented Generation on Complex Documents |
2026 |
VLDB |
1 |
4.9769913e-05 |
| 10,818 |
Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,038 |
Graph-Based Retrieval-Augmented Generation: Applications, Challenges, Solutions, and Opportunities |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,054 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
0 |
4.9769913e-05 |
| 11,228 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4 |
4.9769913e-05 |
| 11,259 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
1 |
4.9769913e-05 |
| 11,265 |
ACE: A Cardinality Estimator for Set-Valued Queries |
2025 |
VLDB |
0 |
4.9769913e-05 |
| 11,329 |
Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory |
2025 |
VLDB |
3 |
4.9769913e-05 |
| 11,586 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
2 |
4.9769913e-05 |
| 11,922 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
9 |
4.9769913e-05 |