Tenindra Abeywickrama
Orcid: 0000-0003-1053-2193
According to our database1,
Tenindra Abeywickrama
authored at least 11 papers
between 2016 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on tenindra.com
On csauthors.net:
Bibliography
2022
Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment.
SIGMOD Rec., 2022
Effectively Relocating Ride-Hailing Drivers Using A Markov Decision Process with Dynamic Sharding.
Proceedings of the 23rd IEEE International Conference on Mobile Data Management, 2022
2021
Optimizing Bipartite Matching in Real-World Applications by Incremental Cost Computation.
Proc. VLDB Endow., 2021
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021
2020
IEEE Trans. Knowl. Data Eng., 2020
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks : (Extended Abstract).
Proceedings of the 36th IEEE International Conference on Data Engineering, 2020
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020
2019
PhD thesis, 2019
2018
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018
2017
Proceedings of the Database Systems for Advanced Applications, 2017
2016
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation.
Proc. VLDB Endow., 2016