| 5,149 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
6.3459884e-05 |
| 5,540 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.1809407e-05 |
| 5,797 |
Effective and Efficient Dynamic Graph Coloring |
2018 |
VLDB |
6.0859157e-05 |
| 5,877 |
Neural Attributed Community Search at Billion Scale |
2023 |
SIGMOD |
6.0551011e-05 |
| 5,952 |
Efficient Processing of XML Path Queries Using the Disk-based F&B Index |
2005 |
VLDB |
6.031089e-05 |
| 5,987 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
6.0183678e-05 |
| 6,075 |
On Querying Historical Connectivity in Temporal Graphs |
2024 |
SIGMOD |
5.9853864e-05 |
| 6,342 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.9068493e-05 |
| 6,367 |
Robust Privacy-Preserving Triangle Counting under Edge Local Differential Privacy |
2025 |
SIGMOD |
5.8981989e-05 |
| 6,535 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
5.8486743e-05 |
| 6,603 |
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond |
2020 |
VLDB |
5.824568e-05 |
| 6,642 |
Missing Data Imputation with Uncertainty-Driven Network |
2024 |
SIGMOD |
5.8157857e-05 |
| 6,937 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
5.7348103e-05 |
| 7,283 |
Demand-Aware Route Planning for Shared Mobility Services |
2020 |
VLDB |
5.6567657e-05 |
| 7,433 |
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations |
2015 |
VLDB |
5.6197531e-05 |
| 7,664 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
5.5720259e-05 |
| 8,008 |
Efficient Recovery of Missing Events |
2013 |
VLDB |
5.5077375e-05 |
| 8,205 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5.4666548e-05 |
| 8,268 |
Efficient Matrix Sketching over Distributed Data |
2017 |
PODS |
5.4574671e-05 |
| 8,650 |
Towards Generating Hop-constrained s-t Simple Path Graphs |
2023 |
SIGMOD |
5.3916003e-05 |
| 8,731 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
5.3766157e-05 |
| 8,760 |
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN |
2009 |
VLDB |
5.3766157e-05 |
| 8,821 |
Efficient Unsupervised Community Search with Pre-trained Graph Transformer |
2024 |
VLDB |
5.3624668e-05 |
| 9,057 |
Efficient Influence Minimization via Node Blocking |
2024 |
VLDB |
5.3251649e-05 |
| 9,301 |
Accelerating Core Decomposition in Billion-Scale Hypergraphs |
2025 |
SIGMOD |
5.289545e-05 |
| 9,304 |
Infinite Stream Estimation under Personalized w-Event Privacy |
2025 |
VLDB |
5.289545e-05 |
| 9,355 |
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates |
2015 |
SIGMOD |
5.282937e-05 |
| 9,356 |
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis |
2015 |
VLDB |
5.282937e-05 |
| 9,557 |
Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy |
2024 |
SIGMOD |
5.2528121e-05 |
| 9,622 |
Revisiting Graph Analytics Benchmark |
2025 |
SIGMOD |
5.2434488e-05 |
| 9,625 |
I/O Efficient Label-Constrained Reachability Queries in Large Graphs |
2024 |
VLDB |
5.2434488e-05 |
| 9,673 |
High-Ratio Compression for Machine-Generated Data |
2023 |
SIGMOD |
5.2383683e-05 |
| 9,688 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
5.2351259e-05 |
| 9,825 |
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets |
2003 |
VLDB |
5.2143223e-05 |
| 9,872 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.2043672e-05 |
| 10,101 |
On Scalable Computation of Graph Eccentricities |
2022 |
SIGMOD |
5.1488731e-05 |
| 10,266 |
Maintaining Biconnected Components in Streaming Graphs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,273 |
Nucleus Decomposition Revisited: An Efficient Counting-Based Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,379 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
5.093636e-05 |
| 10,411 |
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach |
2026 |
SIGMOD |
5.093636e-05 |
| 10,446 |
Efficient and Effective Biclique Counting with Local Differential Privacy |
2026 |
SIGMOD |
5.093636e-05 |
| 10,455 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
5.093636e-05 |
| 10,520 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
5.093636e-05 |
| 10,620 |
Understanding Evolving Graph Structures for Large Discrete-Time Dynamic Graph Representation |
2026 |
VLDB |
5.093636e-05 |
| 10,671 |
Minimum Spanning Tree Maintenance in Dynamic Graphs |
2025 |
SIGMOD |
5.093636e-05 |
| 10,802 |
Most Similar Biclique Search at Scale |
2025 |
VLDB |
5.093636e-05 |
| 10,885 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
5.093636e-05 |
| 10,924 |
On LLM-Enhanced Mixed-Type Data Imputation with High-Order Message Passing |
2025 |
VLDB |
5.093636e-05 |
| 10,946 |
LogLite: Lightweight Plug-and-Play Streaming Log Compression |
2025 |
VLDB |
5.093636e-05 |
| 11,094 |
Efficient Computation of Hyper-triangles on Hypergraphs |
2025 |
VLDB |
5.093636e-05 |