Feng Shi
Orcid: 0000-0002-1415-0515Affiliations:
- Central South University, School of Information Science and Engineering, Changsha, China
According to our database1,
Feng Shi
authored at least 34 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
3
4
2
2
1
4
2
2
2
1
1
2
1
1
1
3
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Comb. Optim., March, 2024
2023
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023
2022
Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem.
CoRR, 2022
Sci. China Inf. Sci., 2022
Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem.
Theor. Comput. Sci., 2021
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem.
Algorithmica, 2021
2020
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition.
Theor. Comput. Sci., 2020
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2020
Proceedings of the Theory and Applications of Models of Computation, 2020
2019
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
Evol. Comput., 2019
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2019
Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019
2018
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees.
J. Comput. Syst. Sci., 2018
Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018
2017
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
2016
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees.
J. Comb. Optim., 2016
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees.
CoRR, 2016
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees.
Sci. China Inf. Sci., 2016
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016
2015
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths.
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
2014
Theor. Comput. Sci., 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
2013
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013