default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYan Lan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Yunxuan Ma, Yan Lan, Yakun Xie, Lanxin Yu, Chen Chen, Yusong Wu, Xiaoai Dai
:
A Spatial-Spectral Transformer for Hyperspectral Image Classification Based on Global Dependencies of Multi-Scale Features. Remote. Sens. 16(2): 404 (2024)- [j14]Yan Lan, Yuan Yuan, Yinling Wang, Xin Han, Yong Zhou:
Flow shop scheduling problems with transportation constraints revisited. Theor. Comput. Sci. 985: 114349 (2024) - 2023
- [i1]Shengzhuo Wei, Yan Lan:
A two-way translation system of Chinese sign language based on computer vision. CoRR abs/2306.02144 (2023) - 2022
- [j13]Yuan Yuan, Yan Lan, Ning Ding, Xin Han:
A PTAS for non-resumable open shop scheduling with an availability constraint. J. Comb. Optim. 43(2): 350-362 (2022) - [j12]Yinling Wang, Yan Lan, Xin Chen, Xin Han, Yong Piao:
A tight approximation algorithm for problem $P2\rightarrow D|v=1, c=1|C_{\max }$. J. Comb. Optim. 44(4): 2195-2206 (2022) - [c4]Yuan Yuan, Xin Han, Yan Lan:
Flow Shop Scheduling Problems with Transportation Constraints Revisited. COCOON 2022: 12-23 - 2021
- [j11]Jiaxin Li, Yan Lan, Feng Chen, Xin Han, Jacek Blazewicz:
A Fast Algorithm for Knapsack Problem with Conflict Graph. Asia Pac. J. Oper. Res. 38(6): 2150010:1-2150010:34 (2021) - [c3]Yuan Yuan, Xin Han, Xinbo Liu, Yan Lan:
Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period. COCOA 2021: 512-526 - 2020
- [j10]Minghui Zhang, Yan Lan, Xin Han:
Approximation algorithms for two-stage flexible flow shop scheduling. J. Comb. Optim. 39(1): 1-14 (2020)
2010 – 2019
- 2017
- [j9]Minghui Zhang, Xin Han, Yan Lan, Hing-Fung Ting:
Online bin packing problem with buffer and bounded size revisited. J. Comb. Optim. 33(2): 530-542 (2017) - [j8]Yan Lan, Fangfang Cao:
面向电影推荐的时间加权协同过滤算法的研究 (Research of Time Weighted Collaborative Filtering Algorithm in Movie Recommendation). 计算机科学 44(4): 295-301 (2017) - [j7]Yan Lan, Xin Han, Yinling Wang, Min Ge, He Guo, Xin Chen:
Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited. Theor. Comput. Sci. 670: 79-85 (2017) - 2016
- [j6]Yan Lan, Xin Han, Zongtao Wu, He Guo, Xin Chen:
Complexity of problem TF2|v=1, c=2|Cmax. Inf. Process. Lett. 116(1): 65-69 (2016) - [j5]Yan Lan, Minghui Zhang, Zongtao Wu, Xin Han:
带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation). 计算机科学 43(9): 18-22 (2016) - 2015
- [c2]Minghui Zhang, Yan Lan, Jifeng Chen:
A Comprehensive College Coaches Evaluation Model Based on AHP and Grey Correlation Theory. BDCloud 2015: 330-334 - 2014
- [j4]Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han:
Online Minimum makespan Scheduling with a Buffer. Int. J. Found. Comput. Sci. 25(5): 525-536 (2014) - 2013
- [j3]Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko:
2D knapsack: Packing squares. Theor. Comput. Sci. 508: 35-40 (2013) - 2012
- [c1]Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han:
Online Minimum Makespan Scheduling with a Buffer. FAW-AAIM 2012: 161-171 - 2011
- [j2]Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han:
Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor. Comput. Sci. 412(45): 6269-6278 (2011) - 2010
- [j1]Xin Han, Chao Peng, Deshi Ye, Dahai Zhang, Yan Lan:
Dynamic bin packing with unit fraction items revisited. Inf. Process. Lett. 110(23): 1049-1054 (2010)
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-08-05 20:20 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:
