![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Xingfu Li
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Yang Deng
, Bangchao Wang
, Qiang Zhu, Junping Liu, Jiewen Kuang, Xingfu Li:
MTLink: Adaptive multi-task learning based pre-trained language model for traceability link recovery between issues and commits. J. King Saud Univ. Comput. Inf. Sci. 36(2): 101958 (2024) - [j10]Bangchao Wang
, Zhiyuan Zou, Hongyan Wan, Yuanbang Li, Yang Deng
, Xingfu Li:
An empirical study on the state-of-the-art methods for requirement-to-code traceability link recovery. J. King Saud Univ. Comput. Inf. Sci. 36(6): 102118 (2024) - 2023
- [c6]Bangchao Wang, Zihan Wang, Hongyan Wan, Xingfu Li, Yang Deng:
An Empirical Study on Data Balancing in Machine Learning Based Software Traceability Methods. IJCNN 2023: 1-8 - [c5]Xingfu Li, Bangchao Wang, Hongyan Wan, Yang Deng, Zihan Wang:
Applications of Machine Learning in Requirements Traceability: A Systematic Mapping Study (S). SEKE 2023: 566-571 - [c4]Bangchao Wang, Yang Deng, Hongyan Wan, Xingfu Li:
DF4RT: Deep Forest for Requirements Traceability Recovery Between Use Cases and Source Code. SMC 2023: 617-622 - [c3]Bangchao Wang, Xingfu Li, Hongyan Wan, Yang Deng:
A Systematic Mapping Study of Machine Learning Techniques Applied to Software Traceability. SMC 2023: 623-628 - 2022
- [j9]Guihai Yu, Xingfu Li, Deyan He:
Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity. Appl. Math. Comput. 416: 126748 (2022) - [j8]Xingfu Li
, Guihai Yu, Kinkar Chandra Das
:
The Average Eccentricity of Block Graphs: A Block Order Sequence Perspective. Axioms 11(3): 114 (2022) - 2021
- [j7]Xingfu Li, Guihai Yu
, Sandi Klavzar
:
On the average Steiner 3-eccentricity of trees. Discret. Appl. Math. 304: 181-195 (2021) - [j6]Xingfu Li, Guihai Yu
:
The average Steiner 3-eccentricity of block graphs. J. Appl. Math. Comput. 67(1-2): 89-100 (2021) - [j5]Xingfu Li, Daming Zhu, Lusheng Wang:
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem. J. Comput. Syst. Sci. 118: 131-140 (2021) - [j4]Xingfu Li, Guihai Yu, Sandi Klavzar, Jie Hu, Bo Li:
The Steiner k-eccentricity on trees. Theor. Comput. Sci. 889: 182-188 (2021) - [i2]Xingfu Li, Guihai Yu, Aleksandar Ilic, Sandi Klavzar:
On the computational complexity of the Steiner k-eccentricity. CoRR abs/2112.01140 (2021) - 2020
- [j3]Guihai Yu, Xingfu Li:
Connective Steiner 3-eccentricity index and network similarity measure. Appl. Math. Comput. 386: 125446 (2020)
2010 – 2019
- 2018
- [j2]Xingfu Li
, Huaping Wang, Qing Shi, Tao Sun, Qiang Huang, Toshio Fukuda:
Construction of Multilayer Porous Scaffold Based on Magnetically Guided Assembly of Microfiber. J. Syst. Sci. Complex. 31(3): 581-595 (2018) - [j1]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theor. Comput. Sci. 734: 32-37 (2018) - 2016
- [c2]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. FAW 2016: 92-101 - 2014
- [c1]Xingfu Li, Daming Zhu:
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover. ISAAC 2014: 467-478 - [i1]Xingfu Li, Daming Zhu:
A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices. CoRR abs/1409.3700 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-23 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint