default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLan Shen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Rong Li, Lan Shen, Wenyan Ma, Linfeng Li, Bo Yan, Yuna Wei
, Yao Wang, Changqing Pan, Junyi Yuan:
Machine learning-based risk models for procedural complications of radiofrequency ablation for atrial fibrillation. BMC Medical Informatics Decis. Mak. 23(1): 257 (2023)- [c2]Jie Wu, Lan Shen, Yanhong Jing, Chengxi Gao:
A Recommendation Model Fusing Knowledge Graph Convolutional Networks and Social Relationships. CAIBDA 2023: 805-812 - [c1]Haipeng Li, Lan Shen, Ying Li, Yanhong Jing, Song Wang, Tian Lv:
CNN-BiLSTM Based Demand Prediction for Shared Bicycles. RICAI 2023: 864-868 - 2022
- [j9]Yuhong Shi, Mo Chen, Chunlong Yao, Xu Li, Lan Shen:
Seabed Sediment Classification for Sonar Images Based on Deep Learning. Comput. Informatics 41(3): 714-738 (2022) - 2021
- [j8]Lan Shen, Min Liu, Chao Wang, Weixun Chen, Zhongkai Sun, He Wen, Yaonan Wang:
Efficient Critical Point Detection for Curvilinear Structures Using a Ring-Like Ray-Shooting Model. IEEE Trans. Instrum. Meas. 70: 1-11 (2021) - [j7]Lan Shen, Min Liu, Chao Wang, Changhao Guo, Erik Meijering, Yaonan Wang:
Efficient 3D Junction Detection in Biomedical Images Based on a Circular Sampling Model and Reverse Mapping. IEEE J. Biomed. Health Informatics 25(5): 1612-1623 (2021)
2010 – 2019
- 2013
- [j6]Chunlong Yao, Wei Pan, Lan Shen, Xu Li:
Research of Multi-sensor Images Based on Color Fusion Methods. J. Networks 8(11): 2635-2641 (2013) - 2010
- [j5]Lan Shen, Yingqian Wang:
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. Discret. Math. 310(17-18): 2372-2379 (2010)
2000 – 2009
- 2009
- [j4]Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih:
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. Appl. Math. Lett. 22(9): 1369-1373 (2009) - [j3]Dingzhu Du, Lan Shen, Yingqian Wang:
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. Discret. Appl. Math. 157(13): 2778-2784 (2009) - [j2]Lan Shen, Yingqian Wang:
On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles. Graphs Comb. 25(3): 401-407 (2009)
1990 – 1999
- 1997
- [j1]Vijay K. Madisetti, Lan Shen:
Interface Design for Core-Based Systems. IEEE Des. Test Comput. 14(4): 42-51 (1997)
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-07 22:13 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:
