Feng Shi

Orcid: 0000-0002-1415-0515

Affiliations:
  • 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:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On scheduling multiple parallel two-stage flowshops with Johnson's Rule.
J. Comb. Optim., March, 2024

2023
Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties.
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

An approximation algorithm for lower-bounded k-median with constant factor.
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
Improved approximation for prize-collecting red-blue median.
Theor. Comput. Sci., 2021

Fixed-parameter tractability for the Tree Assembly problem.
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

Tractabilities for Tree Assembly Problems.
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

An Improved Approximation Algorithm for the k-Means Problem with Penalties.
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

Approximating Maximum Agreement Forest on Multiple Binary Trees.
Algorithmica, 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

Parameterized complexity of control and bribery for d-approval elections.
Theor. Comput. Sci., 2015

2014
Algorithms for parameterized maximum agreement forest problem on multiple trees.
Theor. Comput. Sci., 2014

Algorithms for Maximum Agreement Forest of Multiple General Trees.
CoRR, 2014

On Star-Cover and Path-Cover of a Tree.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013


  Loading...