Jiaao Li

Orcid: 0009-0007-3818-8554

According to our database1, Jiaao Li authored at least 40 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
CLIP-SP: Vision-language model with adaptive prompting for scene parsing.
Comput. Vis. Media, August, 2024

Burst-Enhanced Super-Resolution Network (BESR).
Sensors, April, 2024

An Efficient Hybrid CNN-Transformer Approach for Remote Sensing Super-Resolution.
Remote. Sens., March, 2024

Infrared Small Target Detection Based on Tensor Tree Decomposition and Self-Adaptive Local Prior.
Remote. Sens., March, 2024

Homomorphisms to small negative even cycles.
Eur. J. Comb., 2024

Nowhere-Zero 3-Flows in Signed Planar Graphs.
Electron. J. Comb., 2024

PhosMap: An ensemble bioinformatic platform to empower interactive analysis of quantitative phosphoproteomics.
Comput. Biol. Medicine, 2024

SoK: Opportunities for Accelerating Multi - Party Computation via Trusted Hardware.
Proceedings of the International Symposium on Secure and Private Execution Environment Design, 2024

2023
Multi-Attention Multi-Image Super-Resolution Transformer (MAST) for Remote Sensing.
Remote. Sens., September, 2023

Weakly Supervised Sea Fog Detection in Remote Sensing Images via Prototype Learning.
IEEE Trans. Geosci. Remote. Sens., 2023

2022
The Flow Index of Regular Class I Graphs.
SIAM J. Discret. Math., September, 2022

Circular coloring and fractional coloring in planar graphs.
J. Graph Theory, 2022

Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory B, 2022

A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs.
Graphs Comb., 2022

On 3-flow-critical graphs.
Eur. J. Comb., 2022

2021
Integer Flows and Modulo Orientations of Signed Graphs.
SIAM J. Discret. Math., 2021

Group connectivity under 3-edge-connectivity.
J. Graph Theory, 2021

Flows on flow-admissible signed graphs.
J. Comb. Theory B, 2021

2020
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs.
SIAM J. Discret. Math., 2020

Circular Flows in Planar Graphs.
SIAM J. Discret. Math., 2020

Circular flows via extended Tutte orientations.
J. Comb. Theory B, 2020

Spanning Triangle-Trees and Flows of Graphs.
Graphs Comb., 2020

On weighted modulo orientation of graphs.
Eur. J. Comb., 2020

Flow extensions and group connectivity with applications.
Eur. J. Comb., 2020

Complementary graphs with flows less than three.
Discret. Math., 2020

Contractible graphs for flow index less than three.
Discret. Math., 2020

2019
Packing spanning trees in highly essentially connected graphs.
Discret. Math., 2019

List star edge coloring of k-degenerate graphs.
Discret. Math., 2019

2018
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.
SIAM J. Discret. Math., 2018

Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.
J. Graph Theory, 2018

Counterexamples to Jaeger's Circular Flow Conjecture.
J. Comb. Theory B, 2018

Odd Induced Subgraphs in Graphs with Treewidth at Most Two.
Graphs Comb., 2018

The flow index and strongly connected orientations.
Eur. J. Comb., 2018

Nowhere-zero 3-flow of graphs with small independence number.
Discret. Math., 2018

Flow-contractible configurations and group connectivity of signed graphs.
Discret. Math., 2018

Modulo orientations with bounded independence number.
Discret. Appl. Math., 2018

2017
Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees.
SIAM J. Discret. Math., 2017

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4.
Discret. Math., 2017

A note on broom number and maximum edge-cut of graphs.
Ars Comb., 2017

2015
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow.
Graphs Comb., 2015


  Loading...