| 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 | 64 | 2016 |
| Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks T Abeywickrama, MA Cheema DASFAA (2), 425-440, 2017 | 10 | 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 | 9 | 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 | 3 | 2020 |
| k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited T Abeywickrama, MA Cheema, D Taniar Eleventh Annual Symposium on Combinatorial Search, 2018 | 1 | 2018 |
| 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 | | 2021 |
| In Search of Points of Interest: A Story of Decoupled Heuristics on Road Networks TN ABEYWICKRAMA Monash University, 2019 | | 2019 |
David TaniarMonash University, AustraliaVerified email at monash.edu
