Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2013)

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2014)

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. - Feng Shi 003; Jie You; Qilong Feng (FAW, 2014)

On Star-Cover and Path-Cover of a Tree. - Jie You; Qilong Feng; Jiong Guo; Feng Shi 003 (FAW, 2014)

Algorithms for Maximum Agreement Forest of Multiple General Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Xiaojun Ding; Jianxin Wang 001 (CoRR, 2014)

Algorithms for parameterized maximum agreement forest problem on multiple trees. - Feng Shi 003; Jianxin Wang 001; Jianer Chen; Qilong Feng; Jiong Guo (Theor. Comput. Sci., 2014)

Parameterized complexity of control and bribery for d-approval elections. - Jianxin Wang 001; Weimin Su; Min Yang; Jiong Guo; Qilong Feng; Feng Shi 003; Jianer Chen (Theor. Comput. Sci., 2015)

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. - Jie You; Jianxin Wang 001; Qilong Feng; Feng Shi 003 (Theor. Comput. Sci., 2015)

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. - Mojgan Pourhassan; Feng Shi 003; Frank Neumann 001 (PPSN, 2016)

Approximating Maximum Agreement Forest on Multiple Binary Trees. - Jianer Chen; Feng Shi 003; Jianxin Wang 001 (Algorithmica, 2016)

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. - Feng Shi 003; Jianxin Wang 001; Yufei Yang; Qilong Feng; Weilong Li; Jianer Chen (Sci. China Inf. Sci., 2016)

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (CoRR, 2016)

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. - Feng Shi 003; Qilong Feng; Jie You; Jianxin Wang 001 (J. Comb. Optim., 2016)

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (GECCO, 2017)

Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. - Feng Shi 003; Frank Neumann 001; Jianxin Wang 001 (GECCO, 2018)

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (J. Comput. Syst. Sci., 2018)

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

Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. - Feng Shi 003; Frank Neumann 001; Jianxin Wang 001 (FOGA, 2019)

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2019)

Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. - Mojgan Pourhassan; Feng Shi 003; Frank Neumann 001 (Evol. Comput., 2019)

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

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2020)

Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. - Jie You; Feng Shi 003; Jianxin Wang 001; Qilong Feng (Theor. Comput. Sci., 2020)

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. - Feng Shi 003; Frank Neumann 001; Jianxin Wang 001 (Algorithmica, 2021)

Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem. - Feng Shi 003; Frank Neumann 001; Jianxin Wang 001 (Theor. Comput. Sci., 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)

Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. - Feng Shi 003; Xiankun Yan; Frank Neumann 001 (PPSN (2), 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)

Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem. - Feng Shi 003; Xiankun Yan; Frank Neumann 001 (CoRR, 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)

Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. - Xiankun Yan; Anh Viet Do; Feng Shi 003; Xiaoyu Qin; Frank Neumann 001 (ECAI, 2023)

Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops. - Guangwei Wu; Fu Zuo; Feng Shi 003; Jianxin Wang 001 (IJTCS-FAW, 2023)

On scheduling multiple parallel two-stage flowshops with Johnson's Rule. - Guangwei Wu; Fu Zuo; Feng Shi 003; Jian-Xin Wang 001 (J. Comb. Optim., 2024)

Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows. - Feng Shi 003; Yicong Zhu; Guangwei Wu; Jingyi Liu; Jian-xin Wang 001 (COCOON (2), 2025)

On Online Approximation Algorithms for Two-Stage Bins. - Guangwei Wu; Hongyun He; Guozhen Rong; Feng Shi 003; Yongjie Yang 001 (COCOON (1), 2025)

Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem. - Jingyi Liu; Jianxin Wang 001; Qilong Feng; Feng Shi 003 (IJTCS-FAW, 2025)

Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems. - Jingyi Liu; Xian Chen; Yicheng Zheng; Jianxin Wang 001; Feng Shi 003 (WALCOM, 2025)

Runtime performance of evolutionary algorithms for the chance-constrained makespan scheduling problem. - Feng Shi 003; Daoyu Huang; Xiankun Yan; Frank Neumann 001 (Theor. Comput. Sci., 2025)