An approximation algorithm for maximum weight budgeted connected set cover. - Yingli Ran; Zhao Zhang 002; Ker-I Ko; Jun Liang (J. Comb. Optim., 2016)

Local ratio method on partial set multi-cover. - Yingli Ran; Yishuo Shi; Zhao Zhang 002 (J. Comb. Optim., 2017)

Approximation algorithm for partial positive influence problem in social network. - Yingli Ran; Zhao Zhang 002; Hongwei Du 001; Yuqing Zhu 002 (J. Comb. Optim., 2017)

A simple approximation algorithm for minimum weight partial connected set cover. - Yubai Zhang; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2017)

Primal Dual Algorithm for Partial Set Multi-cover. - Yingli Ran; Yishuo Shi; Zhao Zhang 002 (COCOA, 2018)

Primal dual based algorithm for degree-balanced spanning tree problem. - Yingli Ran; Zhihao Chen 003; Shaojie Tang 001; Zhao Zhang 002 (Appl. Math. Comput., 2018)

Approximation algorithm for distance constraint sweep coverage without predetermined base stations. - Qingqing Chen; Xiaohui Huang 001; Yingli Ran (Discret. Math. Algorithms Appl., 2018)

Approximation Algorithms for the Minimum Power Partial Cover Problem. - Menghong Li; Yingli Ran; Zhao Zhang 002 (AAIM, 2019)

Approximation algorithms for minimum weight connected 3-path vertex cover. - Yingli Ran; Zhao Zhang 002; Xiaohui Huang 001; Xiaosong Li; Ding-Zhu Du (Appl. Math. Comput., 2019)

Approximation algorithm for the partial set multi-cover problem. - Yishuo Shi; Yingli Ran; Zhao Zhang 002; James Willson; Guangmo Tong; Ding-Zhu Du (J. Glob. Optim., 2019)

A primal-dual algorithm for the minimum partial set multi-cover problem. - Yingli Ran; Yishuo Shi; Changbing Tang; Zhao Zhang 002 (J. Comb. Optim., 2020)

Data mule scheduling on a path with handling time and time span constraints. - Zhihao Chen 003; Zhao Zhang 002; Yingli Ran; Yishuo Shi; Ding-Zhu Du (Optim. Lett., 2020)

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. - Yishuo Shi; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (Theor. Comput. Sci., 2020)

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. - Weizhi Hong; Zhao Zhang 002; Yingli Ran (COCOA, 2021)

Parallel approximation for partial set cover. - Yingli Ran; Ying Zhang; Zhao Zhang 002 (Appl. Math. Comput., 2021)

A Parallel Algorithm for Minimum Cost Submodular Cover. - Yingli Ran; Zhao Zhang 002 (CoRR, 2021)

Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. - Yingli Ran; Zhao Zhang 002; Shaojie Tang 001; Ding-Zhu Du (INFORMS J. Comput., 2021)

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. - Yingli Ran; Xiaohui Huang 001; Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2021)

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem. - Yingli Ran; Zhao Zhang 002; Shaojie Tang 001 (COLT, 2022)

Computing Connected-k-Subgraph Cover with Connectivity Requirement. - Pengcheng Liu; Zhao Zhang 002; Yingli Ran; Xiaohui Huang 001 (TAMC, 2022)

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set. - Chaojie Zhu; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (CoRR, 2022)

Approximation Algorithm for Minimum p Union Under a Geometric Setting. - Yingli Ran; Zhao Zhang 002 (CoRR, 2022)

A primal-dual algorithm for the minimum power partial cover problem. - Menghong Li; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2022)

Nearly tight approximation algorithm for (connected) Roman dominating set. - Ke Li; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 2022)

Approximation algorithm for minimum partial multi-cover under a geometric setting. - Yingli Ran; Xiaohui Huang 001; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 2022)

Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. - Weizhi Hong; Yingli Ran; Zhao Zhang 002 (Theor. Comput. Sci., 2022)

Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set. - Jiao Zhou; Yingli Ran; Zhao Zhang 002; Shaojie Tang 001 (CoRR, 2023)

Approximation Algorithm for the Maximum Interval Multi-cover Problem. - Yuxuan Xu; Yingli Ran; Zhao Zhang 002 (AAIM (1), 2024)

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 2024)

Sparse Graphic Degree Sequences Have Planar Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 2024)

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio. - Yaoyao Zhang; Chaojie Zhu; Shaojie Tang 001; Yingli Ran; Ding-Zhu Du; Zhao Zhang 002 (INFORMS J. Comput., 2024)

Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. - Pengcheng Liu; Zhao Zhang 002; Yingli Ran; Xiaohui Huang 001 (Math. Struct. Comput. Sci., 2024)

Approximation algorithms for maximum weighted target cover problem with distance limitations. - Jianhong Jin; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2024)

Degree Realization by Bipartite Cactus Graphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (CIAC (1), 2025)

A New Approximation Algorithm for Minimum-Weight (1,m)-Connected Dominating Set. - Jiao Zhou; Yingli Ran; Panos M. Pardalos; Zhao Zhang 002; Shaojie Tang 001; Ding-Zhu Du (INFORMS J. Comput., 2025)

Approximate realizations for outerplanaric degree sequences. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (J. Comput. Syst. Sci., 2025)

A parallel algorithm for minimum weight set cover with small neighborhood property. - Yingli Ran; Yaoyao Zhang; Zhao Zhang 002 (J. Parallel Distributed Comput., 2025)

A 1/2-approximation algorithm for maximum interval multi-cover. - Yuxuan Xu; Yingli Ran; Zhao Zhang 002 (Theor. Comput. Sci., 2025)

Approximation Algorithm for the Minimum Interval Partial Multi-Cover Problem. - Yingli Ran; Jianhong Jin; Zhao Zhang 002 (Networks, 2025)