Jinghan Xu
Orcid: 0009-0009-7861-7784
According to our database1,
Jinghan Xu
authored at least 20 papers
between 2013 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
FDSR-INT: A Flexible On-Demand In-Band Telemetry Approach for Aerial Computing Networks.
IEEE Internet Things J., July, 2025
IEEE Trans. Pattern Anal. Mach. Intell., June, 2025
LAAP: Learning the Argument of An Entity with Event Prompts for document-level event extraction.
Neurocomputing, 2025
Frontiers Neurorobotics, 2025
TimeTracker: Event-based Continuous Point Tracking for Video Frame Interpolation with Non-linear Motion.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2025
Proceedings of the Algorithms and Discrete Applied Mathematics, 2025
DEEPER Insight into Your User: Directed Persona Refinement for Dynamic Persona Modeling.
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025
2024
Social robots supporting children's learning and development: Bibliometric and visual analysis.
Educ. Inf. Technol., July, 2024
Self-Heating Effect of Device-Circuit with Back-side Power Delivery Network beyond 3nm Node.
Proceedings of the IEEE International Reliability Physics Symposium, 2024
Deep Learning-Assisted Trap Extraction Method from Noise Power Spectral Density for MOSFETs.
Proceedings of the IEEE International Reliability Physics Symposium, 2024
2023
J. King Saud Univ. Comput. Inf. Sci., October, 2023
2018
Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018
2017
Discret. Math., 2017
2016
Discret. Math., 2016
2015
J. Comb. Optim., 2015
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.
Eur. J. Comb., 2015
2014
Discret. Math., 2014
Discret. Math., 2014
2013
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable.
Inf. Process. Lett., 2013