default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingjing Huo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Huadai Liu, Wenqiang Xu, Xuan Lin, Jingjing Huo, Hong Chen, Zhou Zhao:
AntCritic: Argument Mining for Free-Form and Visually-Rich Financial Comments. LREC/COLING 2024: 1306-1317- 2023
- [j14]Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan:
Coloring the square of maximal planar graphs with diameter two. Appl. Math. Comput. 459: 128263 (2023) - [j13]Jingjing Huo
, Sensen Wen, Yulong Chen, Mingchao Li:
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree. Axioms 12(12): 1132 (2023) - [j12]Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo:
Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discret. Appl. Math. 329: 49-60 (2023) - [c5]Song Li, Jingjing Huo, Wenqiang Xu, Maozong Zheng, Kezun Zhang, Hong Chen, Xuan Lin:
Label-Guided Graphormer for Hierarchy Text Classification. ICANN (5) 2023: 536-547 - [c4]Jingjing Huo, Kezun Zhang, Zhengyong Liu, Xuan Lin, Wenqiang Xu, Maozong Zheng, Zhaoguo Wang, Song Li:
AntContentTech at SemEval-2023 Task 6: Domain-adaptive Pretraining and Auxiliary-task Learning for Understanding Indian Legal Texts. SemEval@ACL 2023: 402-408 - 2022
- [j11]Jingjing Huo, Mingchao Li, Ying Wang:
A Characterization for the Neighbor-Distinguishing Index of Planar Graphs. Symmetry 14(7): 1289 (2022) - [i3]Yang Zhao, Wenqiang Xu, Xuan Lin, Jingjing Huo, Hong Chen, Zhou Zhao:
AntCritic: Argument Mining for Free-Form and Visually-Rich Financial Comments. CoRR abs/2208.09612 (2022) - 2021
- [j10]Xinhong Pang, Jingjing Huo, Min Chen, Weifan Wang:
A note on strong edge choosability of toroidal subcubic graphs. Australas. J Comb. 79: 284-294 (2021) - 2020
- [j9]Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia:
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve. J. Comb. Optim. 39(1): 246-272 (2020) - [c3]Xin Jin, Min Chen, Xinhong Pang, Jingjing Huo:
Edge-Face List Coloring of Halin Graphs. AAIM 2020: 481-491 - [c2]Jingjing Huo, Yingbo Gao, Weiyue Wang, Ralf Schlüter, Hermann Ney:
Investigation of Large-Margin Softmax in Neural Language Modeling. INTERSPEECH 2020: 3645-3649 - [c1]Jingjing Huo, Christian Herold, Yingbo Gao, Leonard Dahlmann, Shahram Khadivi, Hermann Ney:
Diving Deep into Context-Aware Neural Machine Translation. WMT@EMNLP 2020: 604-616 - [i2]Jingjing Huo, Yingbo Gao, Weiyue Wang, Ralf Schlüter, Hermann Ney:
Investigation of Large-Margin Softmax in Neural Language Modeling. CoRR abs/2005.10089 (2020) - [i1]Jingjing Huo, Christian Herold, Yingbo Gao, Leonard Dahlmann, Shahram Khadivi, Hermann Ney:
Diving Deep into Context-Aware Neural Machine Translation. CoRR abs/2010.09482 (2020)
2010 – 2019
- 2019
- [j8]Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang:
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. J. Comb. Optim. 37(3): 1071-1089 (2019) - 2018
- [j7]Jingjing Huo, Wai Chee Shiu, Weifan Wang:
The neighbor expanded sum distinguishing index of Halin graphs. Ars Comb. 141: 63-73 (2018) - [j6]Jingjing Huo, Weifan Wang, Yiqiao Wang:
A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. Discret. Math. 341(11): 3044-3056 (2018) - 2017
- [j5]Jingjing Huo, Weifan Wang, Chuandong Xu:
Neighbor Sum Distinguishing Index of Subcubic Graphs. Graphs Comb. 33(2): 419-431 (2017) - [j4]Jingjing Huo, Yiqiao Wang, Weifan Wang:
Neighbor-sum-distinguishing edge choosability of subcubic graphs. J. Comb. Optim. 34(3): 742-759 (2017) - 2015
- [j3]Yiqiao Wang, Wei-Fan Wang, Jingjing Huo:
Some bounds on the neighbor-distinguishing index of graphs. Discret. Math. 338(11): 2006-2013 (2015) - 2013
- [j2]Qingde Kang, Mingchao Li, Jingjing Huo:
Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles. Graphs Comb. 29(4): 1007-1040 (2013)
2000 – 2009
- 2009
- [j1]Mingchao Li, Jingjing Huo, Zhichao Gao:
Maximum Packings and Minimum Coverings of Kv with Octagons. Graphs Comb. 25(5): 735-752 (2009)
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-10-04 21:02 CEST 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:
