| 3,575 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9528126e-05 |
| 4,344 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.2744553e-05 |
| 4,970 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
5.7945079e-05 |
| 5,265 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5972878e-05 |
| 5,513 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
5.4641695e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,719 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
4.9504873e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4443756e-05 |
| 9,089 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.39898e-05 |
| 9,403 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3441378e-05 |
| 9,651 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3109001e-05 |
| 9,670 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
4.3066148e-05 |
| 10,052 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,199 |
R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,209 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,236 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,246 |
Anchored Maximum Communities over Large Directed Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,300 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,308 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1945683e-05 |
| 10,311 |
Efficient Temporal Edge-Core Maintenance in Streaming Graphs |
2026 |
VLDB |
4.1945683e-05 |
| 10,329 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
4.1945683e-05 |
| 10,467 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 10,563 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1945683e-05 |
| 10,584 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1945683e-05 |
| 10,984 |
Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing |
2024 |
SIGMOD |
4.1945683e-05 |
| 11,038 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1945683e-05 |
| 11,140 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
4.1945683e-05 |
| 11,410 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1945683e-05 |
| 11,492 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.1945683e-05 |
| 13,109 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
- |