Jinghan Xu

According to our database, Jinghan Xu authored at least 13 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

LAAP: Learning the Argument of An Entity with Event Prompts for document-level event extraction.

Jinghan Xu, Cheng Yang, Xiaojun Kang

Neurocomputing, 2025

2024

Social robots supporting children's learning and development: Bibliometric and visual analysis.

Na Zhang, Jinghan Xu, Xifeng Zhang, Yifang Wang

Educ. Inf. Technol., July, 2024

Self-Heating Effect of Device-Circuit with Back-side Power Delivery Network beyond 3nm Node.

Pan Zhao, Jinghan Xu, Taoyu Zhou, Songhan Zhao, Naiqi Liu, Xinpeng Li, Yandong He, Xiaoyan Liu, Gang Du

Proceedings of the IEEE International Reliability Physics Symposium, 2024

Deep Learning-Assisted Trap Extraction Method from Noise Power Spectral Density for MOSFETs.

Jinghan Xu, Zheng Zhou, Mengqi Fan, Zixuan Sun, Shuhan Wang, Zili Tang, Fei Liu, Xiaoyan Liu

Proceedings of the IEEE International Reliability Physics Symposium, 2024

2023

A robust VVC video encryption scheme based on the dynamical chaotification model.

Chen Chen, Xingjun Wang, Jinghan Xu

J. King Saud Univ. Comput. Inf. Sci., October, 2023

2018

EEG Emotion Classification Based On Baseline Strategy.

Jinghan Xu, Fuji Ren, Yanwei Bao

Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018

2017

Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable.

Lifeng Dai, Yingqian Wang, Jinghan Xu

Discret. Math., 2017

2016

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable.

Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu

Discret. Math., 2016

2015

(1, 0, 0)-Colorability of planar graphs without prescribed short cycles.

Yuehua Bu, Jinghan Xu, Yingqian Wang

J. Comb. Optim., 2015

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.

Yingqian Wang, Jinghan Xu

Eur. J. Comb., 2015

2014

Improper colorability of planar graphs without prescribed short cycles.

Yingqian Wang, Jinghan Xu

Discret. Math., 2014

Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable.

Huihui Li, Jinghan Xu, Yingqian Wang

Discret. Math., 2014

2013

Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable.

Yingqian Wang, Jinghan Xu

Inf. Process. Lett., 2013