default search action
Jinghan Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Jinghan Xu, Cheng Yang, Xiaojun Kang
:
LAAP: Learning the Argument of An Entity with Event Prompts for document-level event extraction. Neurocomputing 613: 128584 (2025) - 2024
- [j9]Na Zhang
Social robots supporting children's learning and development: Bibliometric and visual analysis. Educ. Inf. Technol. 29(10): 12115-12142 (2024) - [c3]Jinghan Xu, Zheng Zhou, Mengqi Fan, Zixuan Sun, Shuhan Wang, Zili Tang, Fei Liu, Xiaoyan Liu:
Deep Learning-Assisted Trap Extraction Method from Noise Power Spectral Density for MOSFETs. IRPS 2024: 1-7 - [c2]Pan Zhao, Jinghan Xu, Taoyu Zhou, Songhan Zhao, Naiqi Liu, Xinpeng Li, Yandong He, Xiaoyan Liu, Gang Du:
Self-Heating Effect of Device-Circuit with Back-side Power Delivery Network beyond 3nm Node. IRPS 2024: 1-6 - 2023
- [j8]Chen Chen, Xingjun Wang, Jinghan Xu:
A robust VVC video encryption scheme based on the dynamical chaotification model. J. King Saud Univ. Comput. Inf. Sci. 35(9): 101752 (2023)
2010 – 2019
- 2018
- [c1]Jinghan Xu, Fuji Ren, Yanwei Bao:
EEG Emotion Classification Based On Baseline Strategy. CCIS 2018: 43-46 - 2017
- [j7]Lifeng Dai, Yingqian Wang
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. Discret. Math. 340(9): 2108-2122 (2017) - 2016
- [j6]Ming Chen, Yingqian Wang
Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. Discret. Math. 339(2): 886-905 (2016) - 2015
- [j5]Yingqian Wang
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph. Eur. J. Comb. 43: 98-123 (2015) - [j4]Yuehua Bu, Jinghan Xu, Yingqian Wang
(1, 0, 0)-Colorability of planar graphs without prescribed short cycles. J. Comb. Optim. 30(3): 627-646 (2015) - 2014
- [j3]Yingqian Wang
Improper colorability of planar graphs without prescribed short cycles. Discret. Math. 322: 5-14 (2014) - [j2]Huihui Li, Jinghan Xu, Yingqian Wang
Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable. Discret. Math. 327: 29-35 (2014) - 2013
- [j1]Yingqian Wang
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable. Inf. Process. Lett. 113(18): 659-663 (2013)
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-11-07 20:31 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: