default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFeng Shi 0003
Person information
- affiliation: Central South University, School of Information Science and Engineering, Changsha, China
Other persons with the same name
- Feng Shi — disambiguation page
- Feng Shi 0001
![[0000-0003-1522-9943]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-1522-9943")
— Shanghai United Imaging Intelligence Co, Department of Research and Development, China (and 3 more) - Feng Shi 0002 — Beihang University, State Key Lab of Virtual Reality Technology and Systems, Beijing, China
- Feng Shi 0004 — Central South University, School of Traffic and Transportation Engineering, Changsha, China
- Feng Shi 0005 (aka: F. Bill Shi) — University of North Carolina, Odum Institute for Research in Social Science, Chapel Hill, NC, USA
- Feng Shi 0006 — University of California, Computer Science Department, UCLA Center for Vision, Cognition, Learning, and Autonomy, LA, USA
- Feng Shi 0007 — Imperial College London, Dyson School of Design Engineering, UK
- Feng Shi 0008 — University of Cambridge, UK
- Feng Shi 0009 — Beijing Institute of Technology, School of Computer Science and Technology, China
- Feng Shi 0010 — Skyworks Solutions, Inc., Irvine, CA, USA (and 1 more)
- Feng Shi 0011 — Nanjing Forestry University, College of Civil Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Guangwei Wu, Fu Zuo, Feng Shi, Jian-Xin Wang:
On scheduling multiple parallel two-stage flowshops with Johnson's Rule. J. Comb. Optim. 47(2): 12 (2024)- 2023
- [c13]Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, Frank Neumann:
Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. ECAI 2023: 2826-2833 - [c12]Guangwei Wu, Fu Zuo, Feng Shi, Jianxin Wang:
Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops. IJTCS-FAW 2023: 212-224 - [i7]Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, Frank Neumann:
Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. CoRR abs/2309.14359 (2023) - 2022
- [j17]Xiaoliang Wu, Feng Shi, Yutian Guo, Zhen Zhang, Junyu Huang, Jianxin Wang:
An approximation algorithm for lower-bounded k-median with constant factor. Sci. China Inf. Sci. 65(4) (2022) - [j16]Feng Shi, Hangcheng Li, Guozhen Rong, Zhen Zhang, Jianxin Wang:
Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3539-3552 (2022) - [c11]Feng Shi, Xiankun Yan, Frank Neumann:
Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. PPSN (2) 2022: 526-541 - [i6]Feng Shi, Xiankun Yan, Frank Neumann:
Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem. CoRR abs/2212.11478 (2022) - 2021
- [j15]Feng Shi, Frank Neumann, Jianxin Wang:
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. Algorithmica 83(4): 906-939 (2021) - [j14]Zhen Zhang, Yutian Guo, Junyu Huang, Jianxin Wang, Feng Shi:
Improved approximation for prize-collecting red-blue median. Theor. Comput. Sci. 878-879: 67-82 (2021) - [j13]Feng Shi, Jie You, Zhen Zhang, Jingyi Liu, Jianxin Wang:
Fixed-parameter tractability for the Tree Assembly problem. Theor. Comput. Sci. 886: 3-12 (2021) - [j12]Feng Shi, Frank Neumann, Jianxin Wang:
Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem. Theor. Comput. Sci. 893: 159-175 (2021) - [i5]Feng Shi, Frank Neumann, Jianxin Wang:
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem. CoRR abs/2110.04701 (2021) - 2020
- [j11]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 82(10): 3117-3123 (2020) - [j10]Jie You, Feng Shi, Jianxin Wang, Qilong Feng:
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. Theor. Comput. Sci. 806: 256-270 (2020) - [c10]Feng Shi, Jie You, Zhen Zhang, Jingyi Liu:
Tractabilities for Tree Assembly Problems. TAMC 2020: 300-312 - [i4]Feng Shi, Frank Neumann, Jianxin Wang:
Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. CoRR abs/2001.08903 (2020)
2010 – 2019
- 2019
- [j9]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 81(2): 828-857 (2019) - [j8]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. Evol. Comput. 27(4): 559-575 (2019) - [c9]Qilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang:
An Improved Approximation Algorithm for the k-Means Problem with Penalties. FAW 2019: 170-181 - [c8]Feng Shi, Frank Neumann, Jianxin Wang:
Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. FOGA 2019: 133-146 - 2018
- [j7]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. J. Comput. Syst. Sci. 97: 28-44 (2018) - [c7]Feng Shi, Frank Neumann, Jianxin Wang:
Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. GECCO 2018: 1515-1522 - 2017
- [c6]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO 2017: 1407-1414 - 2016
- [j6]Jianer Chen, Feng Shi, Jianxin Wang:
Approximating Maximum Agreement Forest on Multiple Binary Trees. Algorithmica 76(4): 867-889 (2016) - [j5]Feng Shi, Jianxin Wang, Yufei Yang, Qilong Feng, Weilong Li, Jianer Chen:
A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. Sci. China Inf. Sci. 59(1): 1-14 (2016) - [j4]Feng Shi, Qilong Feng, Jie You, Jianxin Wang:
Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. J. Comb. Optim. 32(1): 111-143 (2016) - [c5]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. PPSN 2016: 729-739 - [i3]Mojgan Pourhassan, Feng Shi, Frank Neumann:
Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. CoRR abs/1604.01495 (2016) - [i2]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. CoRR abs/1608.02709 (2016) - 2015
- [j3]Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen:
Parameterized complexity of control and bribery for d-approval elections. Theor. Comput. Sci. 595: 82-91 (2015) - [j2]Jie You, Jianxin Wang, Qilong Feng, Feng Shi:
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. Theor. Comput. Sci. 607: 257-270 (2015) - 2014
- [j1]Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo:
Algorithms for parameterized maximum agreement forest problem on multiple trees. Theor. Comput. Sci. 554: 207-216 (2014) - [c4]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2014: 381-392 - [c3]Feng Shi, Jie You, Qilong Feng:
Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. FAW 2014: 205-215 - [c2]Jie You, Qilong Feng, Jiong Guo, Feng Shi:
On Star-Cover and Path-Cover of a Tree. FAW 2014: 298-308 - [i1]Feng Shi, Jianer Chen, Qilong Feng, Xiaojun Ding, Jianxin Wang:
Algorithms for Maximum Agreement Forest of Multiple General Trees. CoRR abs/1411.0062 (2014) - 2013
- [c1]Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang:
Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2013: 567-578
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
