Xiaoxue Hu

Orcid: 0000-0001-7848-6870

According to our database1, Xiaoxue Hu authored at least 24 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FastTextDodger: Decision-Based Adversarial Attack Against Black-Box NLP Models With Extremely High Efficiency.
IEEE Trans. Inf. Forensics Secur., 2024

An improved upper bound on the edge-face coloring of 2-connected plane graphs.
Discret. Math., 2024

2023
The linear 2-arboricity of IC-planar graphs.
Discret. Appl. Math., October, 2023

Different Characteristics and Drivers of the Extraordinary Pakistan Rainfall in July and August 2022.
Remote. Sens., May, 2023

2022
The Surviving Rate of IC-Planar Graphs.
Symmetry, 2022

2021
Entire coloring of 2-connected plane graphs.
Eur. J. Comb., 2021

2020
Plane graphs of maximum degree Δ ≥ 7 are edge-face (Δ + 1)-colorable.
J. Graph Theory, 2020

Plane graphs with Δ =7 are entirely 10-colorable.
J. Comb. Optim., 2020

2019
Light structures in 1-planar graphs with an application to linear 2-arboricity.
Discret. Appl. Math., 2019

2018
Planar graphs without chordal 5-cycles are 2-good.
J. Comb. Optim., 2018

Entire Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic.
Graphs Comb., 2018

Linear list r-hued coloring of sparse graphs.
Discret. Math. Algorithms Appl., 2018

2017
The entire chromatic number of graphs embedded on the torus with large maximum degree.
Theor. Comput. Sci., 2017

The linear 2-arboricity of sparse graphs.
Discret. Math. Algorithms Appl., 2017

A note on the linear 2-arboricity of planar graphs.
Discret. Math., 2017

The chromatic number of the square of a Halin graph with maximum degree five is six.
Ars Comb., 2017

2016
The entire choosability of plane graphs.
J. Comb. Optim., 2016

Rainbow cliques in edge-colored graphs.
Eur. J. Comb., 2016

Plane graphs with maximum degree 9 are entirely 11-choosable.
Discret. Math., 2016

Efficient Power Allocation under Global Power Cap and Application-Level Power Budget.
Proceedings of the 7th International Conference on Cloud Computing and Big Data, 2016

2014
Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.
SIAM J. Discret. Math., 2014

Plane graphs are entirely (δ + 5)-Choosable.
Discret. Math. Algorithms Appl., 2014

The edge-face choosability of plane graphs with maximum degree at least 9.
Discret. Math., 2014

2009
Genetic Projection Pursuit Interpolation Data Mining Model for Urban Environmental Quality Assessment.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009


  Loading...