An Improved Approximation Algorithm for the k-Means Problem with Penalties. - Qilong Feng; Zhen Zhang 025; Feng Shi 003; Jianxin Wang 001 (FAW, 2019)

Improved Algorithms for Clustering with Outliers. - Qilong Feng; Zhen Zhang 025; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ISAAC, 2019)

A Unified Framework of FPT Approximation Algorithms for Clustering Problems. - Qilong Feng; Zhen Zhang 025; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ISAAC, 2020)

Tractabilities for Tree Assembly Problems. - Feng Shi 003; Jie You; Zhen Zhang 025; Jingyi Liu (TAMC, 2020)

A Constant Factor Approximation for Lower-Bounded k-Median. - Yutian Guo; Junyu Huang; Zhen Zhang 025 (TAMC, 2020)

An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem. - Zhen Zhang 025; Yutian Guo; Junyu Huang (TAMC, 2020)

An Improved Approximation Algorithm for Squared Metric k-Facility Location. - Zhen Zhang 025; Qilong Feng (COCOA, 2021)

Improved Parameterized Approximation for Balanced k-Median. - Zhen Zhang 025; Qilong Feng (COCOA, 2021)

A Parameterized Approximation Algorithm for the Chromatic k-Median Problem. - Zhen Zhang 025; Jinchuan Zhang; Lingzhi Zhu (IEEE Access, 2021)

An approximation algorithm for k-median with priorities. - Zhen Zhang 025; Qilong Feng; Jinhui Xu 001; Jianxin Wang 001 (Sci. China Inf. Sci., 2021)

A local search algorithm for k-means with outliers. - Zhen Zhang 025; Qilong Feng; Junyu Huang; Yutian Guo; Jinhui Xu 001; Jianxin Wang 001 (Neurocomputing, 2021)

Fixed-parameter tractability for the Tree Assembly problem. - Feng Shi 003; Jie You; Zhen Zhang 025; Jingyi Liu; Jianxin Wang 001 (Theor. Comput. Sci., 2021)

Improved approximation for prize-collecting red-blue median. - Zhen Zhang 025; Yutian Guo; Junyu Huang; Jianxin Wang 001; Feng Shi 003 (Theor. Comput. Sci., 2021)

Approximation Schemes for k-Facility Location. - Xiangyan Kong; Zhen Zhang 025 (COCOON, 2022)

An approximation algorithm for lower-bounded k-median with constant factor. - Xiaoliang Wu; Feng Shi 003; Yutian Guo; Zhen Zhang 025; Junyu Huang; Jianxin Wang 001 (Sci. China Inf. Sci., 2022)

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network. - Feng Shi 003; Hangcheng Li; Guozhen Rong; Zhen Zhang 025; Jianxin Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Better guarantees for k-median with service installation costs. - Zhen Zhang 025; Yipeng Zhou; Shaoqian Yu (Theor. Comput. Sci., 2022)

On parameterized approximation algorithms for balanced clustering. - Xiangyan Kong; Zhen Zhang 025; Qilong Feng (J. Comb. Optim., 2023)

Improved approximation algorithms for solving the squared metric k-facility location problem. - Zhen Zhang 025; Qilong Feng; Junyu Huang; Jianxin Wang 001 (Theor. Comput. Sci., 2023)

Fixed-parameter tractability of capacitated k-facility location. - Xiangyan Kong; Zhen Zhang 025 (Frontiers Comput. Sci., 2023)

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation. - Zhen Zhang 025; Junfeng Yang; Limei Liu; Xuesong Xu; Guozhen Rong; Qilong Feng (AAAI, 2024)

Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism. - Hanchun Yuan; Zhen Zhang 025 (COCOA (1), 2024)

Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem. - Zhen Zhang 025; Limei Liu; Yao Liu; Jie Chen; Qilong Feng (IJTCS-FAW, 2024)

Faster Approximation Schemes for (Constrained) k-Means with Outliers. - Zhen Zhang 025; Junyu Huang; Qilong Feng (MFCS, 2024)

Align-IQA: Aligning Image Quality Assessment Models with Diverse Human Preferences via Customizable Guidance. - Junfeng Yang; Jing Fu; Zhen Zhang 025; Limei Liu; Qin Li 010; Wei Zhang 074; Wenzhi Cao (ACM Multimedia, 2024)

Parameterized Approximation Schemes for Fair-Range Clustering. - Zhen Zhang 025; Xiaohong Chen; Limei Liu; Jie Chen; Junyu Huang; Qilong Feng (NeurIPS, 2024)

New Algorithms for the Learning-Augmented k-means Problem. - Junyu Huang; Qilong Feng; Ziyun Huang; Zhen Zhang 025; Jinhui Xu 001; Jianxin Wang 001 (ICLR, 2025)

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem. - Zhen Zhang 025; Zhuohang Gao; Limei Liu; Yao Liu; Jie Chen; Qilong Feng (Theor. Comput. Sci., 2025)