Maximum Packings and Minimum Coverings of Kv with Octagons. - Mingchao Li; Jingjing Huo; Zhichao Gao (Graphs Comb., 2009)

Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles. - Qingde Kang; Mingchao Li; Jingjing Huo (Graphs Comb., 2013)

Some bounds on the neighbor-distinguishing index of graphs. - Yiqiao Wang 002; Wei-Fan Wang 001; Jingjing Huo (Discret. Math., 2015)

Neighbor Sum Distinguishing Index of Subcubic Graphs. - Jingjing Huo; Weifan Wang 001; Chuandong Xu (Graphs Comb., 2017)

Neighbor-sum-distinguishing edge choosability of subcubic graphs. - Jingjing Huo; Yiqiao Wang 002; Weifan Wang 001 (J. Comb. Optim., 2017)

The neighbor expanded sum distinguishing index of Halin graphs. - Jingjing Huo; Wai Chee Shiu; Weifan Wang 001 (Ars Comb., 2018)

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. - Jingjing Huo; Weifan Wang 001; Yiqiao Wang 002 (Discret. Math., 2018)

Planar graphs with $$ Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. - Weifan Wang 001; Jingjing Huo; Danjun Huang; Yiqiao Wang 002 (J. Comb. Optim., 2019)

Edge-Face List Coloring of Halin Graphs. - Xin Jin; Min Chen 012; Xinhong Pang; Jingjing Huo (AAIM, 2020)

Investigation of Large-Margin Softmax in Neural Language Modeling. - Jingjing Huo; Yingbo Gao; Weiyue Wang 001; Ralf Schlüter; Hermann Ney (INTERSPEECH, 2020)

Diving Deep into Context-Aware Neural Machine Translation. - Jingjing Huo; Christian Herold; Yingbo Gao; Leonard Dahlmann; Shahram Khadivi; Hermann Ney (WMT@EMNLP, 2020)

Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. - Jingjing Huo; Yiqiao Wang 002; Weifan Wang 001; Wenjing Xia (J. Comb. Optim., 2020)

A note on strong edge choosability of toroidal subcubic graphs. - Xinhong Pang; Jingjing Huo; Min Chen 012; Weifan Wang 001 (Australas. J Comb., 2021)

AntCritic: Argument Mining for Free-Form and Visually-Rich Financial Comments. - Yang Zhao 022; Wenqiang Xu; Xuan Lin; Jingjing Huo; Hong Chen 002; Zhou Zhao 001 (CoRR, 2022)

A Characterization for the Neighbor-Distinguishing Index of Planar Graphs. - Jingjing Huo; Mingchao Li; Ying Wang (Symmetry, 2022)

Label-Guided Graphormer for Hierarchy Text Classification. - Song Li; Jingjing Huo; Wenqiang Xu; Maozong Zheng; Kezun Zhang; Hong Chen; Xuan Lin (ICANN (5), 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 (SemEval@ACL, 2023)

Neighbor-distinguishing indices of planar graphs with maximum degree ten. - Danjun Huang; Hongfeng Cai; Weifan Wang 001; Jingjing Huo (Discret. Appl. Math., 2023)

Coloring the square of maximal planar graphs with diameter two. - Yiqiao Wang 002; Jingjing Huo; Jiangxu Kong; Qiuyue Tan (Appl. Math. Comput., 2023)

Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree. - Jingjing Huo; Sensen Wen; Yulong Chen; Mingchao Li (Axioms, 2023)

AntCritic: Argument Mining for Free-Form and Visually-Rich Financial Comments. - Huadai Liu; Wenqiang Xu; Xuan Lin; Jingjing Huo; Hong Chen; Zhou Zhao (LREC/COLING, 2024)

Strict neighbor-distinguishing index of outerplanar graphs. - Weifan Wang 001; Lina Zheng; Jing Gu; Yiqiao Wang 002; Jingjing Huo (Discret. Appl. Math., 2025)