Yan Lan

24 papers B 1C 1Misc 1Journal 18Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Social-semantic enhanced dual-intent hypergraph collaborative filtering.
Inf. Sci.
Xianji Cui, Jinhua Zhang, Yan Lan, Shan Huang
2025 J jnl
CAMBSRec: A Context-Aware Multi-Behavior Sequential Recommendation Model.
Informatics
Bohan Zhuang, Yan Lan, Minghui Zhang
2025 — conf
Knowledge Graph and Hypergraph Enabled Semantic Modeling for Dual-Intent Recommendation.
APWeb-WAIM (3)
Xianji Cui, Jinhua Zhang, Yan Lan, Shan Huang
2025 B conf
VRKG-EPCL: Edge Pruning and Contrastive Learning Driven Recommendation via Virtual Relation Knowledge Graph.
ICPADS
Xianji Cui, Jinhua Zhang, Xiaojing Zhang, Yan Lan, Shan Huang
2024 J jnl
A Spatial-Spectral Transformer for Hyperspectral Image Classification Based on Global Dependencies of Multi-Scale Features.
Remote. Sens.
Yunxuan Ma, Yan Lan, Yakun Xie, Lanxin Yu, Chen Chen, Yusong Wu, Xiaoai Dai
2024 J jnl
Flow shop scheduling problems with transportation constraints revisited.
Theor. Comput. Sci.
Yan Lan, Yuan Yuan, Yinling Wang, Xin Han, Yong Zhou
2023 J jnl
A two-way translation system of Chinese sign language based on computer vision.
CoRR
Shengzhuo Wei, Yan Lan
2022 J jnl
A PTAS for non-resumable open shop scheduling with an availability constraint.
J. Comb. Optim.
Yuan Yuan, Yan Lan, Ning Ding, Xin Han
2022 J jnl
A tight approximation algorithm for problem $P2\rightarrow D|v=1, c=1|C_{\max }$.
J. Comb. Optim.
Yinling Wang, Yan Lan, Xin Chen, Xin Han, Yong Piao
2022 Misc conf
Flow Shop Scheduling Problems with Transportation Constraints Revisited.
COCOON
Yuan Yuan, Xin Han, Yan Lan
2021 J jnl
A Fast Algorithm for Knapsack Problem with Conflict Graph.
Asia Pac. J. Oper. Res.
Jiaxin Li, Yan Lan, Feng Chen, Xin Han, Jacek Blazewicz
2021 C conf
Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period.
COCOA
Yuan Yuan, Xin Han, Xinbo Liu, Yan Lan
2020 J jnl
Approximation algorithms for two-stage flexible flow shop scheduling.
J. Comb. Optim.
Minghui Zhang, Yan Lan, Xin Han
2017 J jnl
Flowshop problem F2 → D|v = 1, c ≥ 1|C
Theor. Comput. Sci.
Yan Lan, Xin Han, Yinling Wang, Min Ge, He Guo, Xin Chen
2017 J jnl
Online bin packing problem with buffer and bounded size revisited.
J. Comb. Optim.
Minghui Zhang, Xin Han, Yan Lan, Hing-Fung Ting
2017 J jnl
面向电影推荐的时间加权协同过滤算法的研究 (Research of Time Weighted Collaborative Filtering Algorithm in Movie Recommendation).
计算机科学
Yan Lan, Fangfang Cao
2016 J jnl
Complexity of problem
Inf. Process. Lett.
Yan Lan, Xin Han, Zongtao Wu, He Guo, Xin Chen
2016 J jnl
带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation).
计算机科学
Yan Lan, Minghui Zhang, Zongtao Wu, Xin Han
2015 — conf
A Comprehensive College Coaches Evaluation Model Based on AHP and Grey Correlation Theory.
BDCloud
Minghui Zhang, Yan Lan, Jifeng Chen
2014 J jnl
Online Minimum makespan Scheduling with a Buffer.
Int. J. Found. Comput. Sci.
Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han
2013 J jnl
2D knapsack: Packing squares.
Theor. Comput. Sci.
Yan Lan, György Dósa, Xin Han, Chenyang Zhou, Attila Benko
2012 — conf
Online Minimum Makespan Scheduling with a Buffer.
FAW-AAIM
Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han
2011 J jnl
Optimal algorithms for online scheduling with bounded rearrangement at the end.
Theor. Comput. Sci.
Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han
2010 J jnl
Dynamic bin packing with unit fraction items revisited.
Inf. Process. Lett.
Xin Han, Chao Peng, Deshi Ye, Dahai Zhang, Yan Lan