An Approximation Algorithm for the Smallest Color-Spanning Circle Problem. - Yin Wang 002; Yinfeng Xu (COCOON, 2015)

The approximation algorithms for a class of multiple-choice problem. - Yin Wang 002; Yinfeng Xu (Theor. Comput. Sci., 2016)

An Approximation Algorithm for the k-Connected Location Set Cover Problem with Color-Spanning Constraint. - Yin Wang 002; Yinfeng Xu (APMS (3), 2021)

The 2-Mixed-Center Color Spanning Problem. - Yin Wang 002; Yi Xu; Yinfeng Xu; Huili Zhang (COCOA (2), 2023)

Online k-color spanning disk problems. - Yin Wang 002; Yinfeng Xu; Huili Zhang; Weitian Tong (J. Comb. Optim., 2023)