Spherical t휀-designs for approximations on the sphere. - Yang Zhou 018; Xiaojun Chen 001 (Math. Comput., 2018)

Least-Element Time-Stepping Methods for Simulation of Linear Networks with Ideal Switches. - Shuhuang Xiang; Xiaojun Chen 001; Yang Zhou 018 (Circuits Syst. Signal Process., 2019)

A Bi-criteria Analysis for Fuzzy C-means Problem. - Yang Zhou 018; Jianxin Liu; Min Li 028; Qian Liu 016 (AAIM, 2020)

An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint. - Xin Sun; Dachuan Xu; Dongmei Zhang 002; Yang Zhou 018 (CSoNet, 2020)

Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. - Jiachen Ju; Min Li 028; Jianxin Liu; Qian Liu 016; Yang Zhou 018 (PAAP, 2020)

A Novel Initialization Algorithm for Fuzzy C-means Problem. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (TAMC, 2020)

Quadrature rules with neighborhood of spherical designs on the two-sphere. - Yang Zhou 018 (Appl. Math. Comput., 2020)

A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems. - Qian Liu 016; Yuqing Xu; Yang Zhou 018 (J. Glob. Optim., 2020)

Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (AAIM, 2021)

Two-Stage Stochastic Max-Weight Independent Set Problems. - Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOA, 2021)

Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice. - Jingjing Tan; Fengmin Wang; Xiaoqing Zhang; Yang Zhou 018 (COCOA, 2021)

Approximation algorithms for fuzzy C-means problem based on seeding method. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (Theor. Comput. Sci., 2021)

Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (AAIM, 2022)

A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set. - Yuefang Lian; Dachuan Xu; Donglei Du; Yang Zhou 018 (COCOON, 2022)

Non-monotone k-Submodular Function Maximization with Individual Size Constraints. - Hao Xiao; Qian Liu 016; Yang Zhou 018; Min Li 028 (CSoNet, 2022)

Maximizing Modular plus Non-monotone Submodular Functions. - Xin Sun; Dachuan Xu; Yang Zhou 018; Chenchen Wu (CoRR, 2022)

An improved approximation algorithm for maximizing a DR-submodular function over a convex set. - Donglei Du; Zhicheng Liu; Chenchen Wu; Dachuan Xu; Yang Zhou 018 (CoRR, 2022)

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (J. Comb. Optim., 2022)

The submodularity of two-stage stochastic maximum-weight independent set problems. - Min Li 028; Hao Xiao; Qian Liu 016; Yang Zhou 018 (Theor. Comput. Sci., 2022)

Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice. - Jingjing Tan; Fengmin Wang; Weina Ye; Xiaoqing Zhang; Yang Zhou 018 (Theor. Comput. Sci., 2022)

DR-Submodular Function Maximization with Adaptive Stepsize. - Yanfei Li; Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOON (1), 2023)

The Regularized Submodular Maximization via the Lyapunov Method. - Xin Sun; Congying Han; Chenchen Wu; Dachuan Xu; Yang Zhou 018 (COCOON (2), 2023)

Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints. - YuYing Li; Min Li 028; Yang Zhou 018; Qian Liu 016 (IJTCS-FAW, 2023)

Approximation Algorithms for Matroid and Knapsack Means Problems. - Ao Zhao; Qian Liu 016; Yang Zhou 018; Min Li 028 (Asia Pac. J. Oper. Res., 2023)

On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (J. Comb. Optim., 2023)

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint. - Haifeng Huang; Qian Liu 016; Yang Zhou 018; Min Li 028 (AAIM (1), 2024)

Stochastic Variance Reduction for DR-Submodular Maximization. - Yuefang Lian; Donglei Du; Xiao Wang 011; Dachuan Xu; Yang Zhou 018 (Algorithmica, 2024)

Maximizing a $ k $-submodular function with $ p $-system constraints. - Hanlu Ye; Min Li 028; Yang Zhou 018; Qian Liu 016 (Math. Found. Comput., 2025)

Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. - Shuxian Niu; Qian Liu 016; Yang Zhou 018; Min Li 028 (Discret. Math. Algorithms Appl., 2025)

Randomized approximation algorithms for monotone k-submodular function maximization with constraints. - Yuying Li; Min Li 028; Yang Zhou 018; Shuxian Niu; Qian Liu 016 (J. Comb. Optim., 2025)