Genetic Projection Pursuit Interpolation Data Mining Model for Urban Environmental Quality Assessment. - Xiaohua Yang; Xiaoxue Hu; Dunxian She; Wei Wang; Jianqiang Li (CSIE (4), 2009)

The edge-face choosability of plane graphs with maximum degree at least 9. - Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Math., 2014)

Plane graphs are entirely (δ + 5)-Choosable. - Xiaoxue Hu; Yiqiao Wang 002 (Discret. Math. Algorithms Appl., 2014)

Planar Graphs with $ Delta ge 9$ are Entirely (Δ+2)-Colorable. - Yiqiao Wang 002; Xiaoxue Hu; Wei-Fan Wang 001 (SIAM J. Discret. Math., 2014)

Efficient Power Allocation under Global Power Cap and Application-Level Power Budget. - Xiaoxue Hu; Zhongzhi Luan; Depei Qian (CCBD, 2016)

Plane graphs with maximum degree 9 are entirely 11-choosable. - Xiaoxue Hu; Weifan Wang 001; Wai Chee Shiu; Yiqiao Wang 002 (Discret. Math., 2016)

Rainbow cliques in edge-colored graphs. - Chuandong Xu; Xiaoxue Hu; Weifan Wang 001; Shenggui Zhang (Eur. J. Comb., 2016)

The entire choosability of plane graphs. - Wei-Fan Wang 001; Tingting Wu; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2016)

The chromatic number of the square of a Halin graph with maximum degree five is six. - Yiqiao Wang 002; Xiaoxue Hu; Weifan Wang 001 (Ars Comb., 2017)

A note on the linear 2-arboricity of planar graphs. - Yiqiao Wang 002; Xiaoxue Hu; Wei-Fan Wang 001 (Discret. Math., 2017)

The linear 2-arboricity of sparse graphs. - Yuanchao Li; Xiaoxue Hu (Discret. Math. Algorithms Appl., 2017)

The entire chromatic number of graphs embedded on the torus with large maximum degree. - Xiaoxue Hu; Ping Wang 023; Yiqiao Wang 002; Weifan Wang 001 (Theor. Comput. Sci., 2017)

Linear list r-hued coloring of sparse graphs. - Hongping Ma; Xiaoxue Hu; Jiangxu Kong; Murong Xu (Discret. Math. Algorithms Appl., 2018)

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic. - Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002; Ping Wang 023 (Graphs Comb., 2018)

Planar graphs without chordal 5-cycles are 2-good. - Weifan Wang 001; Tingting Wu; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2018)

Light structures in 1-planar graphs with an application to linear 2-arboricity. - Juan Liu; Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2019)

Plane graphs with Δ =7 are entirely 10-colorable. - Jiangxu Kong; Xiaoxue Hu; Yiqiao Wang 002 (J. Comb. Optim., 2020)

Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable. - Yiqiao Wang 002; Xiaoxue Hu; Weifan Wang 001; Ko-Wei Lih (J. Graph Theory, 2020)

Entire coloring of 2-connected plane graphs. - Weifan Wang 001; Xiaoxue Hu; Yiqiao Wang 002 (Eur. J. Comb., 2021)

The Surviving Rate of IC-Planar Graphs. - Xiaoxue Hu; Jiacheng Hu; Jiangxu Kong (Symmetry, 2022)

Different Characteristics and Drivers of the Extraordinary Pakistan Rainfall in July and August 2022. - Yuanyuan Ma; Xiaoxue Hu; Yiting Chen; Zhiyuan Hu; Taichen Feng; Guolin Feng (Remote. Sens., 2023)

The linear 2-arboricity of IC-planar graphs. - Juan Liu; Xiaoxue Hu; Dongdong Zhang; Jiangxu Kong (Discret. Appl. Math., 2023)

An improved upper bound on the edge-face coloring of 2-connected plane graphs. - Juan Liu; Xiaoxue Hu; Jiangxu Kong (Discret. Math., 2024)

FastTextDodger: Decision-Based Adversarial Attack Against Black-Box NLP Models With Extremely High Efficiency. - Xiaoxue Hu; Geling Liu; Baolin Zheng; Lingchen Zhao; Qian Wang 002; Yufei Zhang; Minxin Du (IEEE Trans. Inf. Forensics Secur., 2024)

Acyclic choosability of IC-planar graphs. - Ze Hu; Xiaoxue Hu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2025)

Dynamic coloring of IC-planar graphs. - Xiaoxue Hu; Jiangxu Kong; Weifan Wang 001; Wanshun Yang (Discret. Appl. Math., 2025)