Preprints
- Under Review: Tenindra Abeywickrama, Muhammad Aamir Cheema, and Sabine Storandt.
COL-Trees: Efficient Hierarchical Object Search in Road Networks.
Submitted to Artificial Intelligence (Invited Award Paper Track). [Code] [Paper]
Refereed Conferences and Journals
- SIGMOD Record 2022: Tenindra Abeywickrama, Victor Liang, and Kian-Lee Tan.
Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment.
SIGMOD Record, 51(1):51–58. SIGMOD Research Highlight Award [Paper]
- IEEE MDM 2022 (Short Paper): Keru Chen, Wentong Li, Michael Chirico, and Tenindra Abeywickrama.
Effectively Relocating Ride-Hailing Drivers Using A Markov Decision Process with Dynamic Sharding.
Proc. of the 23rd IEEE International Conference on Mobile Data Management
- VLDB 2021: Tenindra Abeywickrama, Victor Liang, and Kian-Lee Tan.
Optimizing Bipartite Matching in Real-World Applications by Incremental Cost Computation.
Proc. of the VLDB Endowment Vol 14. Best Scalable Data Science Paper Award [Paper]
- IJCAI 2021 (Extended Abstract): Tenindra Abeywickrama, Muhammad Aamir Cheema, and Sabine Storandt.
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract).
Proc. of the 30th International Joint Conference on Artificial Intelligence. Invited Paper - Best Papers from Sister Conferences
- ICAPS 2020: Tenindra Abeywickrama, Muhammad Aamir Cheema, and Sabine Storandt.
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks.
Proc. of the 30th International Conference on Automated Planning and Scheduling. Best Paper Award [Paper]
- ICDE 2020 (Extended Abstract): Tenindra Abeywickrama, Muhammad Aamir Cheema, and Arijit Khan. 2020.
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks (Extended Abstract).
Proc. of the 36th IEEE International Conference on Data Engineering
- TKDE 2020: Tenindra Abeywickrama, Muhammad Aamir Cheema, and Arijit Khan
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks.
IEEE Transactions on Knowledge and Data Engineering, 32(5):983–997 [Paper]
- SOCS 2018 (Extended Abstract): Tenindra Abeywickrama, Muhammad Aamir Cheema, and David Taniar.
k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited.
Proc. of the 11th Annual Symposium on Combinatorial Search
- DASFAA 2017: Tenindra Abeywickrama and Muhammad Aamir Cheema.
Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks.
Proc. of the 22nd International Conference on Database Systems for Advanced Applications [Paper]
- VLDB 2016: Tenindra Abeywickrama, Muhammad Aamir Cheema, and David Taniar.
K-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation.
Proc. of the VLDB Endowment Vol 9. [Code] [Paper] [Extended Version]
Patents
- Tenindra Nadeeshan Abeywickrama, Chen Liang.
System and method for bipartite matching.
US Patent No. US12260357B2, Granted Mar. 2025
- Chunda Ding, Xiaocheng Huang, Minbo Qiu, Tenindra Nadeeshan Abeywickrama, Chen Liang.
Method of annotating map data for navigation of vehicles.
US Patent App. 18/561,112, Pending (Published Nov. 2024)
Articles
- Tenindra Abeywickrama and Victor Liang. "Using real-world patterns to improve matching in theory and practice" in Grab Tech Blog (Nov 2021) [Link]