Common Deadline Lazy Bureaucrat Scheduling Revisited. - Ling Gai; Guochuan Zhang (LATIN, 2006)

On lazy bureaucrat scheduling with common deadlines. - Ling Gai; Guochuan Zhang (J. Comb. Optim., 2008)

Hardness of lazy packing and covering. - Ling Gai; Guochuan Zhang (Oper. Res. Lett., 2009)

Blocking Rumor by Cut. - Ling Gai; Hongwei Du 001; Lidong Wu; Junlei Zhu; Yuehua Bu (J. Comb. Optim., 2018)

Online lazy bureaucrat scheduling with a machine deadline. - Ling Gai; Guochuan Zhang (J. Comb. Optim., 2018)

Minimum choosability of planar graphs. - Huijuan Wang; Bin Liu 009; Ling Gai; Hongwei Du 001; Jianliang Wu 001 (J. Comb. Optim., 2018)

An integrated method to solve the healthcare facility layout problem under area constraints. - Ling Gai; Jiandong Ji (J. Comb. Optim., 2019)

Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. - Ling Gai; Ying Jin; Binyuan Zhang (AAIM, 2020)

Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs. - Sai Ji; Dachuan Xu; Donglei Du; Ling Gai (AAIM, 2020)

The Spherical k-means++ Algorithm via Local Search. - Xiaoyun Tian; Dachuan Xu; Donglei Du; Ling Gai (AAIM, 2020)

Selfish Bin Packing with Parameterized Punishment. - Weiwei Zhang; Alin Gao; Ling Gai (AAIM, 2020)

A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions. - Min Cui; Donglei Du; Ling Gai; Ruiqi Yang (COCOA, 2021)

On Various Open-End Bin Packing Game. - Ling Gai; Weiwei Zhang; Wenchang Luo; Yukun Cheng (COCOA, 2021)

Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming. - Ling Gai; Zhiyue Peng; Jiming Zhang; Jiafu Zhang (J. Comb. Optim., 2021)

Obnoxious Facility Location Games with Candidate Locations. - Ling Gai; Mengpei Liang; Chenhao Wang 001 (AAIM, 2022)

Online One-Sided Smooth Function Maximization. - Hongxiang Zhang; Dachuan Xu; Ling Gai; Zhenning Zhang (COCOON, 2022)

Two-Facility Location Games with Distance Requirement. - Ling Gai; Dandan Qian; Chenchen Wu (FAW, 2022)

An integrated method for hybrid distribution with estimation of demand matching degree. - Ling Gai; Ying Jin; Binyuan Zhang (J. Comb. Optim., 2022)

The spherical k-means++ algorithm via local search scheme. - Xiaoyun Tian; Dachuan Xu; Donglei Du; Ling Gai (J. Comb. Optim., 2022)

Selfish bin packing under Harmonic mean cost sharing mechanism. - Ling Gai; Chenchen Wu; Dachuan Xu; Weiwei Zhang (Optim. Lett., 2022)

Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques. - Xiaoyun Tian; Ling Gai; Yicheng Xu; Dongmei Zhang (Asia Pac. J. Oper. Res., 2023)

Effective Heuristic Techniques for Combined Robust Clustering Problem. - Yunhe Xu; Chenchen Wu; Ling Gai; Lu Han (Asia Pac. J. Oper. Res., 2023)

Green supplier selection and order allocation using linguistic Z-numbers MULTIMOORA method and bi-objective non-linear programming. - Ling Gai; Hu-chen Liu; Yanjun Wang; Yuping Xing (Fuzzy Optim. Decis. Mak., 2023)

Discrete facility location games with different preferences. - Ling Gai; Mengpei Liang; Chenhao Wang 001 (J. Comb. Optim., 2023)

Approximating Continuous Multi-agent Contracts with Lyapunov Function Methods. - Qinqin Gong; Donglei Du; Ling Gai; Dachuan Xu; Ruiqi Yang (COCOON (2), 2024)

Minimum Sum Vertex Cover: Kernelization and Parameterized Algorithms. - Jingyi Liu; Yixin Cao; Ling Gai; Jianxin Wang (COCOON (1), 2024)

Approximating Principal-Agent Problem Under Bayesian. - Qinqin Gong; Ling Gai; Yijing Wang; Dachuan Xu; Ruiqi Yang (IJTCS-FAW, 2024)

Selfish bin packing with punishment. - Ling Gai; Weiwei Zhang; Zhao Zhang 002 (Theor. Comput. Sci., 2024)

Two-facility-location games with mixed types of agents. - Ling Gai; Mengpei Liang; Chenhao Wang 001 (Appl. Math. Comput., 2024)

Online learning under one sided σ-smooth function. - Hongxiang Zhang; Dachuan Xu; Ling Gai; Zhenning Zhang (J. Comb. Optim., 2024)

Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions. - Min Cui; Donglei Du; Ling Gai; Ruiqi Yang (Int. J. Found. Comput. Sci., 2024)

Minimum sum vertex cover: Difficulty of ordering. - Jingyi Liu; Yixin Cao 001; Ling Gai; Jianxin Wang (Theor. Comput. Sci., 2025)

Approximating combinatorial contracts with a cardinality constraint. - Qinqin Gong; Ling Gai; Yanjun Jiang; Yang Lv; Ruiqi Yang (J. Comb. Optim., 2025)