Parameterized analysis of multiobjective evolutionary algorithms and the weighted vertex cover problem M Pourhassan, F Shi, F Neumann Evolutionary Computation 27 (4), 559-575, 2019 | 24 | 2019 |

An Improved Approximation Algorithm for the *k*-Means Problem with PenaltiesQ Feng, Z Zhang, F Shi, J Wang Frontiers in Algorithmics: 13th International Workshop, FAW 2019, Sanya …, 2019 | 21 | 2019 |

Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints F Shi, M Schirneck, T Friedrich, T Kötzing, F Neumann Algorithmica 81 (2), 828-857, 2019 | 20 | 2019 |

Approximating maximum agreement forest on multiple binary trees J Chen, F Shi, J Wang Algorithmica 76, 867-889, 2016 | 17 | 2016 |

A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees F Shi, J Chen, Q Feng, J Wang Journal of Computer and System Sciences 97, 28-44, 2018 | 12 | 2018 |

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints F Shi, M Schirneck, T Friedrich, T Kötzing, F Neumann Proceedings of the Genetic and Evolutionary Computation Conference, 1407-1414, 2017 | 12 | 2017 |

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees F Shi, Q Feng, J You, J Wang Journal of Combinatorial Optimization 32, 111-143, 2016 | 11 | 2016 |

Parameterized complexity of control and bribery for d-approval elections J Wang, W Su, M Yang, J Guo, Q Feng, F Shi, J Chen Theoretical Computer Science 595, 82-91, 2015 | 11 | 2015 |

Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem F Shi, F Neumann, J Wang Proceedings of the Genetic and Evolutionary Computation Conference, 1515-1522, 2018 | 8 | 2018 |

Algorithms for parameterized maximum agreement forest problem on multiple trees F Shi, J Wang, J Chen, Q Feng, J Guo Theoretical Computer Science 554, 207-216, 2014 | 8 | 2014 |

Runtime analysis of simple evolutionary algorithms for the chance-constrained makespan scheduling problem F Shi, X Yan, F Neumann International Conference on Parallel Problem Solving from Nature, 526-541, 2022 | 7 | 2022 |

Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem F Shi, F Neumann, J Wang Algorithmica 83 (4), 906-939, 2021 | 7 | 2021 |

Distances between phylogenetic trees: a survey F Shi, Q Feng, J Chen, L Wang, J Wang Tsinghua Science and Technology 18 (5), 490-499, 2013 | 7 | 2013 |

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. F Shi, J Wang, Y Yang, Q Feng, W Li, J Chen Sci. China Inf. Sci. 59 (1), 1-14, 2016 | 5 | 2016 |

Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem F Shi, F Neumann, J Wang Theoretical Computer Science 893, 159-175, 2021 | 4 | 2021 |

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths J You, J Wang, Q Feng, F Shi Theoretical Computer Science 607, 257-270, 2015 | 4 | 2015 |

Approximation algorithms for maximum agreement forest on multiple trees F Shi, J Chen, Q Feng, J Wang International Computing and Combinatorics Conference, 381-392, 2014 | 4 | 2014 |

Improved approximation algorithm for maximum agreement forest of two trees F Shi, J You, Q Feng International Workshop on Frontiers in Algorithmics, 205-215, 2014 | 4 | 2014 |

Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem F Shi, F Neumann, J Wang Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic …, 2019 | 3 | 2019 |

Parameterized algorithms for maximum agreement forest on multiple trees F Shi, J Chen, Q Feng, J Wang International Computing and Combinatorics Conference, 567-578, 2013 | 3 | 2013 |