Tenindra Abeywickrama
![profile.jpg](/assets/img/profile.jpg?67952e0a5dce08dafa5d93d3fe53b816)
Welcome to my new page! I’m a researcher passionate about finding intuitive ideas to solve real-world computing problems and developing them into efficient, theoretically robust, and scalable algorithms. My areas of interest are data management, graph algorithms, and data science with applications in location and map-based services.
Bio: I completed my PhD in Computer Science at Monash University under Prof. Aamir Cheema. I have previously been a Data Scientist at Grab, a Postdoctoral Fellow in the Grab-NUS AI Laboratory at the National University of Singapore, and an Endeavour Australia Cheung Kong Research Fellow at CUHK. I received my bachelor’s degrees (B.Eng and B.Sc) from the University of New South Wales in Sydney.
news
Jul 22, 2024 | The new site is online, more updates to follow! |
---|
selected publications
- SIGMOD Rec.Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal AssignmentSIGMOD Record, Jun 2022
- VLDB2021Optimizing Bipartite Matching in Real-World Applications by Incremental Cost ComputationProceedings of the VLDB Endowment, Mar 2021
- ICAPS2020Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road NetworksIn Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, ICAPS 2020, Mar 2020