| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 2,643 |
Scaling Distance Labeling on Small-World Networks |
2019 |
SIGMOD |
8.3894193e-05 |
| 3,346 |
P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators |
2021 |
SIGMOD |
7.1903469e-05 |
| 4,194 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.3640644e-05 |
| 4,620 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0368524e-05 |
| 5,035 |
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties |
2020 |
SIGMOD |
5.7414979e-05 |
| 5,255 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
5.5991117e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 5,933 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
5.2620152e-05 |
| 6,491 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0368875e-05 |
| 6,497 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0324877e-05 |
| 6,595 |
Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks |
2023 |
SIGMOD |
4.9949537e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 8,252 |
Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement |
2022 |
VLDB |
4.544713e-05 |
| 8,526 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
4.4893996e-05 |
| 9,074 |
Continuously Monitoring Alternative Shortest Paths on Road Networks |
2020 |
VLDB |
4.3965098e-05 |
| 9,207 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3694476e-05 |
| 9,472 |
Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks |
2025 |
SIGMOD |
4.3300131e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3006524e-05 |
| 10,075 |
Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,088 |
Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,524 |
Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,592 |
Efficient Maintenance of 2-Hop Labeling Index on Dynamic Small-World Graphs |
2025 |
VLDB |
4.1905499e-05 |
| 10,608 |
Continuous Lifelong Conflict-Aware AGV Routing with Kinematic Constraints |
2025 |
VLDB |
4.1905499e-05 |
| 10,677 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
4.1905499e-05 |
| 10,878 |
A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks |
2025 |
VLDB |
4.1905499e-05 |
| 10,960 |
Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach |
2024 |
SIGMOD |
4.1905499e-05 |
| 11,041 |
Distributed Shortest Distance Labeling on Large-Scale Graphs |
2024 |
VLDB |
4.1905499e-05 |
| 11,068 |
Efficient kNN Search in Public Transportation Networks |
2024 |
VLDB |
4.1905499e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
| 11,241 |
TASK: An Efficient Framework for Instant Error-tolerant Spatial Keyword Queries on Road Networks |
2023 |
VLDB |
4.1905499e-05 |