default search action
Xiaohan Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j9]Xiaohan Cheng, Jie Hu, Donglei Yang:
Compatible powers of Hamilton cycles in dense graphs. J. Graph Theory 108(2): 257-273 (2025) - 2024
- [i6]Taiyuan Mei, Yun Zi, Xiaohan Cheng, Zijun Gao, Qi Wang, Haowei Yang:
Efficiency optimization of large-scale language models based on deep learning in natural language processing tasks. CoRR abs/2405.11704 (2024) - [i5]Zijun Gao, Qi Wang, Taiyuan Mei, Xiaohan Cheng, Yun Zi, Haowei Yang:
An Enhanced Encoder-Decoder Network Architecture for Reducing Information Loss in Image Semantic Segmentation. CoRR abs/2406.01605 (2024) - [i4]Xiaohan Cheng, Taiyuan Mei, Yun Zi, Qi Wang, Zijun Gao, Haowei Yang:
Algorithm Research of ELMo Word Embedding and Deep Learning Multimodal Transformer in Image Description. CoRR abs/2408.06357 (2024) - [i3]Qi Wang, Zijun Gao, Mingxiu Sui, Taiyuan Mei, Xiaohan Cheng, Iris Li:
Enhancing Convolutional Neural Networks with Higher-Order Numerical Difference Methods. CoRR abs/2409.04977 (2024) - 2023
- [i2]Xinxin Yan, Zhideng Zhou, Xiaohan Cheng, Xiaolei Yang:
Time integration schemes based on neural networks for solving partial differential equations on coarse grids. CoRR abs/2310.10308 (2023) - 2022
- [j8]Xiaohan Cheng, Bin Wang, Jihui Wang:
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11. Discret. Appl. Math. 313: 29-39 (2022) - 2020
- [j7]Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu:
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discret. Math. 343(7): 111856 (2020) - [i1]Xiaohan Cheng:
Obtain Employee Turnover Rate and Optimal Reduction Strategy Based On Neural Network and Reinforcement Learning. CoRR abs/2012.00583 (2020)
2010 – 2019
- 2019
- [j6]Xiaohan Cheng
:
A Fourth Order Entropy Stable Scheme for Hyperbolic Conservation Laws. Entropy 21(5): 508 (2019) - [j5]Xiaohan Cheng, Jian-Hu Feng:
A sixth-order finite difference WENO scheme for Hamilton-Jacobi equations. Int. J. Comput. Math. 96(3): 568-584 (2019) - 2018
- [j4]Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven. J. Comb. Optim. 35(1): 1-13 (2018) - 2017
- [j3]Lin Sun, Xiaohan Cheng, Jianliang Wu:
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. J. Comb. Optim. 33(2): 779-790 (2017) - [j2]Xiaohan Cheng, Guanghui Wang, Jianliang Wu:
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. J. Comb. Optim. 34(2): 383-397 (2017) - 2015
- [j1]Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu:
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Discret. Appl. Math. 190-191: 34-41 (2015)
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 2025-01-13 21:34 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: