K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation T Abeywickrama, MA Cheema, D Taniar arXiv preprint arXiv:1601.01549, 2016 | 176 | 2016 |
Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks T Abeywickrama, MA Cheema DASFAA (2), 425-440, 2017 | 20 | 2017 |
K-SPIN: Efficiently processing spatial keyword queries on road networks T Abeywickrama, MA Cheema, A Khan IEEE Transactions on Knowledge and Data Engineering 32 (5), 983-997, 2019 | 17 | 2019 |
Hierarchical graph traversal for aggregate k nearest neighbors search in road networks T Abeywickrama, MA Cheema, S Storandt Proceedings of the international conference on automated planning and …, 2020 | 10 | 2020 |
Optimizing bipartite matching in real-world applications by incremental cost computation T Abeywickrama, V Liang, KL Tan Proceedings of the VLDB Endowment 14 (7), 1150-1158, 2021 | 9 | 2021 |
K-nearest neighbors on road networks: A journey in experimentation and in-memory implementation. arXiv 2016 T Abeywickrama, MA Cheema, D Taniar arXiv preprint arXiv:1601.01549, 0 | 7 | |
Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment T Abeywickrama, V Liang, KL Tan ACM SIGMOD Record 51 (1), 51-58, 2022 | 1 | 2022 |
k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited T Abeywickrama, M Cheema, D Taniar Proceedings of the International Symposium on Combinatorial Search 9 (1 …, 2018 | 1 | 2018 |
Effectively Relocating Ride-Hailing Drivers Using A Markov Decision Process with Dynamic Sharding K Chen, W Li, M Chirico, T Abeywickrama 2022 23rd IEEE International Conference on Mobile Data Management (MDM), 70-72, 2022 | | 2022 |
In Search of Points of Interest: A Story of Decoupled Heuristics on Road Networks TN ABEYWICKRAMA Monash University, 2019 | | 2019 |