Jingjing Huo

According to our database, Jingjing Huo authored at least 19 papers between 2009 and 2023.

Collaborative distances:

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

2023

Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree.

Jingjing Huo, Sensen Wen, Yulong Chen, Mingchao Li

Axioms, December, 2023

Coloring the square of maximal planar graphs with diameter two.

Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan

Appl. Math. Comput., December, 2023

Neighbor-distinguishing indices of planar graphs with maximum degree ten.

Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo

Discret. Appl. Math., April, 2023

AntContentTech at SemEval-2023 Task 6: Domain-adaptive Pretraining and Auxiliary-task Learning for Understanding Indian Legal Texts.

Jingjing Huo, Kezun Zhang, Zhengyong Liu, Xuan Lin, Wenqiang Xu, Maozong Zheng, Zhaoguo Wang, Song Li

Proceedings of the The 17th International Workshop on Semantic Evaluation, 2023

2022

A Characterization for the Neighbor-Distinguishing Index of Planar Graphs.

Jingjing Huo, Mingchao Li, Ying Wang

Symmetry, 2022

AntCritic: Argument Mining for Free-Form and Visually-Rich Financial Comments.

Yang Zhao, Wenqiang Xu, Xuan Lin, Jingjing Huo, Hong Chen, Zhou Zhao

CoRR, 2022

2021

A note on strong edge choosability of toroidal subcubic graphs.

Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang

Australas. J Comb., 2021

2020

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve.

Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia

J. Comb. Optim., 2020

Diving Deep into Context-Aware Neural Machine Translation.

Jingjing Huo, Christian Herold, Yingbo Gao, Leonard Dahlmann, Shahram Khadivi, Hermann Ney

Proceedings of the Fifth Conference on Machine Translation, 2020

Investigation of Large-Margin Softmax in Neural Language Modeling.

Jingjing Huo, Yingbo Gao, Weiyue Wang, Ralf Schlüter, Hermann Ney

Proceedings of the Interspeech 2020, 2020

Edge-Face List Coloring of Halin Graphs.

Xin Jin, Min Chen, Xinhong Pang, Jingjing Huo

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable.

Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang

J. Comb. Optim., 2019

2018

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.

Jingjing Huo, Weifan Wang, Yiqiao Wang

Discret. Math., 2018

The neighbor expanded sum distinguishing index of Halin graphs.

Jingjing Huo, Wai Chee Shiu, Weifan Wang

Ars Comb., 2018

2017

Neighbor-sum-distinguishing edge choosability of subcubic graphs.

Jingjing Huo, Yiqiao Wang, Weifan Wang

J. Comb. Optim., 2017

Neighbor Sum Distinguishing Index of Subcubic Graphs.

Jingjing Huo, Weifan Wang, Chuandong Xu

Graphs Comb., 2017

2015

Some bounds on the neighbor-distinguishing index of graphs.

Yiqiao Wang, Wei-Fan Wang, Jingjing Huo

Discret. Math., 2015

2013

Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles.

Qingde Kang, Mingchao Li, Jingjing Huo

Graphs Comb., 2013

2009

Maximum Packings and Minimum Coverings of <i>K</i>_<i>v</i> with Octagons.

Mingchao Li, Jingjing Huo, Zhichao Gao

Graphs Comb., 2009