default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBojie Shen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Ahmed Fahmin
, Bojie Shen, Muhammad Aamir Cheema, Adel Nadjaran Toosi, Mohammed Eunus Ali:
Efficient Alternative Route Planning in Road Networks. IEEE Trans. Intell. Transp. Syst. 25(10): 14220-14232 (2024)- [c9]Abdallah Abu-Aisha, Mark Wallace, Daniel Harabor, Bojie Shen:
Efficient and Exact Public Transport Routing via a Transfer Connection Database. SOCS 2024: 2-10 - [i3]Ammar Sohail, Bojie Shen, Muhammad Aamir Cheema, Mohammed Eunus Ali, Anwaar Ulhaq, Muhammad Ali Babar, Asama Qureshi:
Beyond Data, Towards Sustainability: A Sydney Case Study on Urban Digital Twins. CoRR abs/2406.04902 (2024) - [i2]Jinchun Du, Bojie Shen, Muhammad Aamir Cheema:
EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding. CoRR abs/2408.11341 (2024) - 2023
- [c8]Jinchun Du, Bojie Shen, Muhammad Aamir Cheema:
Ultrafast Euclidean Shortest Path Computation Using Hub Labeling. AAAI 2023: 12417-12426 - [c7]Bojie Shen, Zhe Chen, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Beyond Pairwise Reasoning in Multi-Agent Path Finding. ICAPS 2023: 384-392 - [c6]Jinchun Du, Bojie Shen, Shizhe Zhao, Muhammad Aamir Cheema, Adel Nadjaran Toosi:
Efficient Object Search in Game Maps. IJCAI 2023: 5567-5576 - [c5]Bojie Shen:
Tracking Progress in Multi-Agent Path Finding (Student Abstract). SOCS 2023: 200-201 - [i1]Bojie Shen, Zhe Chen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Tracking Progress in Multi-Agent Path Finding. CoRR abs/2305.08446 (2023) - 2022
- [j4]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Fast optimal and bounded suboptimal Euclidean pathfinding. Artif. Intell. 302: 103624 (2022) - [c4]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Improving Time-Dependent Contraction Hierarchies. ICAPS 2022: 338-347 - 2021
- [c3]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Contracting and Compressing Shortest Path Databases. ICAPS 2021: 322-330 - 2020
- [j3]Bojie Shen, Md. Saiful Islam, David Taniar:
Direction-based Spatial Skyline for Retrieving Arbitrary-Shaped Surrounding Objects. Comput. J. 63(11): 1668-1688 (2020) - [j2]Md. Saiful Islam, Bojie Shen, Can Wang, David Taniar, Junhu Wang:
Efficient processing of reverse nearest neighborhood queries in spatial databases. Inf. Syst. 92: 101530 (2020) - [j1]Bojie Shen, Md. Saiful Islam, David Taniar, Junhu Wang:
Direction-based spatial skyline for retrieving surrounding objects. World Wide Web 23(1): 207-239 (2020) - [c2]Bojie Shen, Muhammad Aamir Cheema, Daniel Harabor, Peter J. Stuckey:
Euclidean Pathfinding with Compressed Path Databases. IJCAI 2020: 4229-4235
2010 – 2019
- 2019
- [c1]Bojie Shen, Md. Saiful Islam, David Taniar, Junhu Wang:
Retrieving Text-Based Surrounding Objects in Spatial Databases. AINA 2019: 927-939
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-10-23 21:21 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:
