default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTenindra Abeywickrama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Tenindra Abeywickrama
, Victor Liang, Kian-Lee Tan:
Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment. SIGMOD Rec. 51(1): 51-58 (2022)- [c6]Keru Chen, Wentong Li, Michael Chirico, Tenindra Abeywickrama:
Effectively Relocating Ride-Hailing Drivers Using A Markov Decision Process with Dynamic Sharding. MDM 2022: 70-72 - 2021
- [j3]Tenindra Abeywickrama, Victor Liang, Kian-Lee Tan:
Optimizing Bipartite Matching in Real-World Applications by Incremental Cost Computation. Proc. VLDB Endow. 14(7): 1150-1158 (2021) - [c5]Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt:
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract). IJCAI 2021: 4730-4734 - 2020
- [j2]Tenindra Abeywickrama, Muhammad Aamir Cheema, Arijit Khan:
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks. IEEE Trans. Knowl. Data Eng. 32(5): 983-997 (2020) - [c4]Tenindra Abeywickrama, Muhammad Aamir Cheema, Sabine Storandt:
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks. ICAPS 2020: 2-10 - [c3]Tenindra Abeywickrama, Muhammad Aamir Cheema, Arijit Khan:
K-SPIN: Efficiently Processing Spatial Keyword Queries on Road Networks : (Extended Abstract). ICDE 2020: 2036-2037
2010 – 2019
- 2019
- [b1]Tenindra Nadeeshan Abeywickrama:
In Search of Points of Interest: A Story of Decoupled Heuristics on Road Networks. Monash University, Australia, 2019 - 2018
- [c2]Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar:
k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited. SOCS 2018: 184-185 - 2017
- [c1]Tenindra Abeywickrama, Muhammad Aamir Cheema:
Efficient Landmark-Based Candidate Generation for kNN Queries on Road Networks. DASFAA (2) 2017: 425-440 - 2016
- [j1]Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar:
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation. Proc. VLDB Endow. 9(6): 492-503 (2016) - [i1]Tenindra Abeywickrama, Muhammad Aamir Cheema, David Taniar:
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation. CoRR abs/1601.01549 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
