![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Wen Sun 0005
Person information
- affiliation (PhD 2018): University of Angers, France
Other persons with the same name
- Wen Sun — disambiguation page
- Wen Sun 0001 — University of Science and Technology of China, Hefei, China
- Wen Sun 0002 — Cornell University, Ithaca, NY, USA (and 2 more)
- Wen Sun 0003
— Yangtze University, School of Information and Mathematics, Jingzhou, China (and 1 more)
- Wen Sun 0004
— Xidian University, School of Cyber Engineering, State Key Laboratory of Integrated Services Networks, Xi'an, China (and 1 more)
Refine list
![note](https://dblp.dagstuhl.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
- [j8]Wen Sun, Chaofan Chen, Jin-Kao Hao
, Wenlong Li, Qinghua Wu, Yuning Chen:
A knowledge-based iterated local search for the weighted total domination problem. Inf. Sci. 665: 120364 (2024) - 2023
- [j7]Wen Sun, Wenlong Li, Jin-Kao Hao, Qinghua Wu:
Learning-based multi-start iterated local search for the profit maximization set covering problem. Inf. Sci. 646: 119404 (2023) - [j6]Wen Sun, Jin-Kao Hao
, Zihao Wu, Wenlong Li, Qinghua Wu:
Dynamic thresholding search for the feedback vertex set problem. PeerJ Comput. Sci. 9: e1245 (2023) - 2022
- [j5]Wen Sun, Jin-Kao Hao
, Wenlong Li, Qinghua Wu:
An adaptive memetic algorithm for the bidirectional loop layout problem. Knowl. Based Syst. 258: 110002 (2022) - 2021
- [j4]Wen Sun, Jin-Kao Hao, Yuhao Zang
, Xiangjing Lai:
A solution-driven multilevel approach for graph coloring. Appl. Soft Comput. 104: 107174 (2021) - 2020
- [j3]Wen Sun, Jin-Kao Hao, Wenyu Wang
, Qinghua Wu:
Memetic search for the equitable coloring problem. Knowl. Based Syst. 188 (2020)
2010 – 2019
- 2019
- [j2]Wen Sun, Jin-Kao Hao
, Alexandre Caminada:
Iterated backtrack removal search for finding k-vertex-critical subgraphs. J. Heuristics 25(4-5): 565-590 (2019) - 2018
- [b1]Wen Sun:
Heuristic Algorithms for Graph Coloring Problems. (Algorithmes heuristiques pour des problèmes de coloration de graphes). University of Angers, France, 2018 - [j1]Wen Sun, Jin-Kao Hao
, Xiangjing Lai, Qinghua Wu:
Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inf. Sci. 466: 203-219 (2018) - 2017
- [c1]Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
On feasible and infeasible search for equitable graph coloring. GECCO 2017: 369-376
Coauthor Index
![](https://dblp.dagstuhl.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-09-04 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint