Cost effective mobile and static road side unit deployment for vehicular adhoc networks. - Donghyun Kim 001; Yesenia Velasco; Zishen Yang; Wei Wang 032; Rasheed Hussain; R. N. Uma (ICNC, 2016)

Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs. - Xianliang Liu; Zishen Yang; Wei Wang 032 (Discret. Appl. Math., 2016)

The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs. - Xianliang Liu; Wei Wang 032; Donghyun Kim 001; Zishen Yang; Alade O. Tokuta; Yaolin Jiang (Wirel. Networks, 2016)

On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network. - Zishen Yang; Donghyun Kim 001; Wei Wang 195 (COCOA (2), 2017)

Complexity and algorithms for the connected vertex cover problem in 4-regular graphs. - Yuchao Li; Zishen Yang; Wei Wang 195 (Appl. Math. Comput., 2017)

Algorithm and complexity of the two disjoint connected dominating sets problem on trees. - Xianliang Liu; Zishen Yang; Wei Wang 195 (Appl. Math. Comput., 2018)

Some results for the two disjoint connected dominating sets problem. - Xianliang Liu; Zishen Yang; Wei Wang 195 (Discret. Math. Algorithms Appl., 2019)

The connected vertex cover problem in k-regular graphs. - Yuchao Li; Wei Wang 195; Zishen Yang (J. Comb. Optim., 2019)

Minimum non-submodular cover problem with applications. - Majun Shi; Zishen Yang; Wei Wang 032 (Appl. Math. Comput., 2021)

The t-latency bounded strong target set selection problem in some kinds of special family of graphs. - Xianliang Liu; Zishen Yang; Wei Wang 195 (J. Comb. Optim., 2021)

Non-monotone submodular function maximization under k-system constraint. - Majun Shi; Zishen Yang; Donghyun Kim 001; Wei Wang 032 (J. Comb. Optim., 2021)

On multi-path routing for reliable communications in failure interdependent complex networks. - Zishen Yang; Wei Wang 195; Donghyun Kim 001 (J. Comb. Optim., 2021)

Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling. - Zishen Yang; Wei Wang 032; Majun Shi (J. Optim. Theory Appl., 2021)

Greedy approximation for the minimum connected dominating set with labeling. - Zishen Yang; Majun Shi; Wei Wang 032 (Optim. Lett., 2021)

Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem. - Majun Shi; Zishen Yang; Wei Wang 032 (J. Comb. Optim., 2023)

Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications. - Majun Shi; Zishen Yang; Wei Wang 032 (J. Optim. Theory Appl., 2023)

Submodular + Supermodular function maximization with knapsack constraint. - Majun Shi; Zishen Yang; Wei Wang (Discret. Appl. Math., 2025)