default search action
Xiaoxue Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Juan Liu, Xiaoxue Hu
, Jiangxu Kong:
An improved upper bound on the edge-face coloring of 2-connected plane graphs. Discret. Math. 347(12): 114173 (2024) - [j21]Xiaoxue Hu, Geling Liu, Baolin Zheng, Lingchen Zhao
FastTextDodger: Decision-Based Adversarial Attack Against Black-Box NLP Models With Extremely High Efficiency. IEEE Trans. Inf. Forensics Secur. 19: 2398-2411 (2024) - 2023
- [j20]Juan Liu, Xiaoxue Hu
The linear 2-arboricity of IC-planar graphs. Discret. Appl. Math. 338: 1-7 (2023) - [j19]Yuanyuan Ma, Xiaoxue Hu
Different Characteristics and Drivers of the Extraordinary Pakistan Rainfall in July and August 2022. Remote. Sens. 15(9): 2311 (2023) - 2022
- [j18]Xiaoxue Hu
The Surviving Rate of IC-Planar Graphs. Symmetry 14(6): 1258 (2022) - 2021
- [j17]Weifan Wang, Xiaoxue Hu, Yiqiao Wang:
Entire coloring of 2-connected plane graphs. Eur. J. Comb. 94: 103286 (2021) - 2020
- [j16]Jiangxu Kong, Xiaoxue Hu
Plane graphs with Δ =7 are entirely 10-colorable. J. Comb. Optim. 40(1): 1-20 (2020) - [j15]Yiqiao Wang, Xiaoxue Hu, Weifan Wang
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. J. Graph Theory 95(1): 99-124 (2020)
2010 – 2019
- 2019
- [j14]Juan Liu, Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
Light structures in 1-planar graphs with an application to linear 2-arboricity. Discret. Appl. Math. 267: 120-130 (2019) - 2018
- [j13]Hongping Ma, Xiaoxue Hu, Jiangxu Kong, Murong Xu
Linear list r-hued coloring of sparse graphs. Discret. Math. Algorithms Appl. 10(4): 1850045:1-1850045:12 (2018) - [j12]Xiaoxue Hu, Weifan Wang, Yiqiao Wang, Ping Wang:
Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. Graphs Comb. 34(6): 1489-1506 (2018) - [j11]Weifan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
Planar graphs without chordal 5-cycles are 2-good. J. Comb. Optim. 35(3): 980-996 (2018) - 2017
- [j10]Yiqiao Wang, Xiaoxue Hu, Weifan Wang:
The chromatic number of the square of a Halin graph with maximum degree five is six. Ars Comb. 133: 217-231 (2017) - [j9]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
A note on the linear 2-arboricity of planar graphs. Discret. Math. 340(7): 1449-1455 (2017) - [j8]Yuanchao Li, Xiaoxue Hu:
The linear 2-arboricity of sparse graphs. Discret. Math. Algorithms Appl. 9(4): 1750047:1-1750047:10 (2017) - [j7]Xiaoxue Hu, Ping Wang, Yiqiao Wang, Weifan Wang:
The entire chromatic number of graphs embedded on the torus with large maximum degree. Theor. Comput. Sci. 689: 108-116 (2017) - 2016
- [j6]Xiaoxue Hu, Weifan Wang, Wai Chee Shiu
Plane graphs with maximum degree 9 are entirely 11-choosable. Discret. Math. 339(11): 2742-2753 (2016) - [j5]Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang:
Rainbow cliques in edge-colored graphs. Eur. J. Comb. 54: 193-200 (2016) - [j4]Wei-Fan Wang, Tingting Wu, Xiaoxue Hu, Yiqiao Wang:
The entire choosability of plane graphs. J. Comb. Optim. 31(3): 1221-1240 (2016) - [c2]Xiaoxue Hu, Zhongzhi Luan, Depei Qian:
Efficient Power Allocation under Global Power Cap and Application-Level Power Budget. CCBD 2016: 157-161 - 2014
- [j3]Xiaoxue Hu, Weifan Wang, Yiqiao Wang:
The edge-face choosability of plane graphs with maximum degree at least 9. Discret. Math. 327: 1-8 (2014) - [j2]Xiaoxue Hu, Yiqiao Wang:
Plane graphs are entirely (δ + 5)-Choosable. Discret. Math. Algorithms Appl. 6(2) (2014) - [j1]Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable. SIAM J. Discret. Math. 28(4): 1892-1905 (2014)
2000 – 2009
- 2009
- [c1]Xiaohua Yang, Xiaoxue Hu, Dunxian She, Wei Wang, Jianqiang Li:
Genetic Projection Pursuit Interpolation Data Mining Model for Urban Environmental Quality Assessment. CSIE (4) 2009: 805-809
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-07 21:23 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: