Dynamic bin packing with unit fraction items revisited. - Xin Han; Chao Peng; Deshi Ye; Dahai Zhang; Yan Lan (Inf. Process. Lett., 2010)

Optimal algorithms for online scheduling with bounded rearrangement at the end. - Xin Chen 032; Yan Lan; Attila Benko; György Dósa; Xin Han (Theor. Comput. Sci., 2011)

Online Minimum Makespan Scheduling with a Buffer. - Yan Lan; Xin Chen 032; Ning Ding; György Dósa; Xin Han (FAW-AAIM, 2012)

2D knapsack: Packing squares. - Yan Lan; György Dósa; Xin Han; Chenyang Zhou 001; Attila Benko (Theor. Comput. Sci., 2013)

Online Minimum makespan Scheduling with a Buffer. - Ning Ding; Yan Lan; Xin Chen 032; György Dósa; He Guo 001; Xin Han (Int. J. Found. Comput. Sci., 2014)

A Comprehensive College Coaches Evaluation Model Based on AHP and Grey Correlation Theory. - Minghui Zhang; Yan Lan; Jifeng Chen (BDCloud, 2015)

Complexity of problem TF2|v=1, c=2|Cmax. - Yan Lan; Xin Han; Zongtao Wu; He Guo 001; Xin Chen 032 (Inf. Process. Lett., 2016)

带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation). - Yan Lan; Minghui Zhang; Zongtao Wu; Xin Han (计算机科学, 2016)

Online bin packing problem with buffer and bounded size revisited. - Minghui Zhang; Xin Han; Yan Lan; Hing-Fung Ting (J. Comb. Optim., 2017)

面向电影推荐的时间加权协同过滤算法的研究 (Research of Time Weighted Collaborative Filtering Algorithm in Movie Recommendation). - Yan Lan; Fangfang Cao (计算机科学, 2017)

Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited. - Yan Lan; Xin Han; Yinling Wang 001; Min Ge; He Guo 001; Xin Chen 032 (Theor. Comput. Sci., 2017)

Approximation algorithms for two-stage flexible flow shop scheduling. - Minghui Zhang; Yan Lan; Xin Han (J. Comb. Optim., 2020)

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period. - Yuan Yuan 020; Xin Han; Xinbo Liu; Yan Lan (COCOA, 2021)

A Fast Algorithm for Knapsack Problem with Conflict Graph. - Jiaxin Li; Yan Lan; Feng Chen 004; Xin Han; Jacek Blazewicz (Asia Pac. J. Oper. Res., 2021)

Flow Shop Scheduling Problems with Transportation Constraints Revisited. - Yuan Yuan 020; Xin Han; Yan Lan (COCOON, 2022)

A tight approximation algorithm for problem $P2 rightarrow D|v=1, c=1|C_{ max }$. - Yinling Wang 001; Yan Lan; Xin Chen 032; Xin Han; Yong Piao (J. Comb. Optim., 2022)

A PTAS for non-resumable open shop scheduling with an availability constraint. - Yuan Yuan 020; Yan Lan; Ning Ding; Xin Han (J. Comb. Optim., 2022)

A two-way translation system of Chinese sign language based on computer vision. - Shengzhuo Wei; Yan Lan (CoRR, 2023)

A Spatial-Spectral Transformer for Hyperspectral Image Classification Based on Global Dependencies of Multi-Scale Features. - Yunxuan Ma; Yan Lan; Yakun Xie; Lanxin Yu; Chen Chen; Yusong Wu; Xiaoai Dai (Remote. Sens., 2024)

Flow shop scheduling problems with transportation constraints revisited. - Yan Lan; Yuan Yuan 020; Yinling Wang; Xin Han; Yong Zhou (Theor. Comput. Sci., 2024)