| 3,579 |
Finding Locally Densest Subgraphs: A Convex Programming Approach |
2022 |
VLDB |
6.9461197e-05 |
| 4,341 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs |
2020 |
SIGMOD |
6.268429e-05 |
| 4,726 |
On Querying Connected Components in Large Temporal Graphs |
2023 |
SIGMOD |
5.9632682e-05 |
| 5,274 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery |
2022 |
SIGMOD |
5.5919087e-05 |
| 5,525 |
Effective Community Search over Large Star-Schema Heterogeneous Information Networks |
2022 |
VLDB |
5.4589218e-05 |
| 6,185 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1618114e-05 |
| 6,720 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection |
2022 |
VLDB |
4.9457362e-05 |
| 8,809 |
Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.4401156e-05 |
| 9,086 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.3947639e-05 |
| 9,409 |
A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3399748e-05 |
| 9,652 |
Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery |
2023 |
SIGMOD |
4.3067693e-05 |
| 9,670 |
On Efficient Large Sparse Matrix Chain Multiplication |
2024 |
SIGMOD |
4.3024878e-05 |
| 10,052 |
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,199 |
R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,209 |
Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,236 |
A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,246 |
Anchored Maximum Communities over Large Directed Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,312 |
Scalable Approximate Biclique Counting over Large Bipartite Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,320 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1905499e-05 |
| 10,323 |
Efficient Temporal Edge-Core Maintenance in Streaming Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,341 |
Revisiting Task-Oriented Dataset Search in the Era of Large Language Models: Challenges, Benchmark, and Solution |
2026 |
VLDB |
4.1905499e-05 |
| 10,477 |
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,544 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1905499e-05 |
| 10,572 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1905499e-05 |
| 10,592 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,987 |
Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,143 |
MOSER: Scalable Network Motif Discovery using Serial Test |
2024 |
VLDB |
4.1905499e-05 |
| 11,413 |
Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques |
2022 |
VLDB |
4.1905499e-05 |
| 11,496 |
On Analyzing Graphs with Motif-Paths |
2021 |
VLDB |
4.1905499e-05 |
| 13,123 |
SemExplorer: A User Interface for Semantic Approach to Customized Dataset Search |
2025 |
SIGMOD |
- |