Qinghai Liu

Orcid: 0009-0008-4157-5309

According to our database1, Qinghai Liu authored at least 52 papers between 2008 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Two stage Ordered Escape Routing combined with LP and heuristic algorithm for large scaled PCB.
Integr., 2025

2024
TanrsColour: Transformer-based medical image colourization with content and structure preservation.
IET Image Process., August, 2024

Digital Twin-Enabled Efficient Federated Learning for Collision Warning in Intelligent Driving.
IEEE Trans. Intell. Transp. Syst., March, 2024

Gallai's conjecture for 3-degenerated graphs.
Discret. Math., 2024

On the edge reconstruction of the characteristic and permanental polynomials of a simple graph.
Discret. Math., 2024

2023
Connectivity keeping trees in 3-connected or 3-edge-connected graphs.
Discret. Math., December, 2023

Two completely independent spanning trees of split graphs.
Discret. Appl. Math., December, 2023

Digital-Twin-Assisted Resource Allocation for Network Slicing in Industry 4.0 and Beyond Using Distributed Deep Reinforcement Learning.
IEEE Internet Things J., October, 2023

Handoff Control and Resource Allocation for RAN Slicing in IoT Based on DTN: An Improved Algorithm Based on Actor-Critic Framework.
IEEE Internet Things J., August, 2023

Equilibrated and Fast Resources Allocation for Massive and Diversified MTC Services Using Multiagent Deep Reinforcement Learning.
IEEE Internet Things J., 2023

Deep Reinforcement Learning for Resource Demand Prediction and Virtual Function Network Migration in Digital Twin Network.
IEEE Internet Things J., 2023

DTN-Assisted Dynamic Cooperative Slicing for Delay-Sensitive Service in MEC-Enabled IoT via Deep Deterministic Policy Gradient With Variable Action.
IEEE Internet Things J., 2023

Federated Continuous Learning Based on Stacked Broad Learning System Assisted by Digital Twin Networks: An Incremental Learning Approach for Intrusion Detection in UAV Networks.
IEEE Internet Things J., 2023

Stacked Broad Learning System Empowered FCL Assisted by DTN for Intrusion Detection in UAV Networks.
Proceedings of the IEEE Global Communications Conference, 2023

Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

A Matching Based Escape Routing Algorithm with Variable Design Rules and Constraints.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

Efficient Global Optimization for Large Scaled Ordered Escape Routing.
Proceedings of the 28th Asia and South Pacific Design Automation Conference, 2023

2022
Mader's conjecture for graphs with small connectivity.
J. Graph Theory, 2022

2021
The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs.
J. Graph Theory, 2021

Connectivity keeping caterpillars and spiders in 2-connected graphs.
Discret. Math., 2021

Implications in rainbow forbidden subgraphs.
Discret. Math., 2021

On Gallai's conjecture for graphs with maximum degree 6.
Discret. Math., 2021

Trail-connected tournaments.
Appl. Math. Comput., 2021

2020
SIR Meta Distribution in the Heterogeneous and Hybrid Networks.
Wirel. Commun. Mob. Comput., 2020

A characterization of nonfeasible sets in matching covered graphs.
J. Graph Theory, 2020

The Chromatic Number of Graphs with No Induced Subdivision of K<sub>4</sub>.
Graphs Comb., 2020

Edge decomposition of connected claw-free cubic graphs.
Discret. Appl. Math., 2020

Hamiltonian Path Based Mixed-Cell-Height Legalization for Neighbor Diffusion Effect Mitigation.
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020

2019
2-bisections in claw-free cubic multigraphs.
Discret. Appl. Math., 2019

The reliability of lexicographic product digraphs.
Appl. Math. Comput., 2019

2018
Circumference of 3-connected cubic graphs.
J. Comb. Theory B, 2018

Bipartite Ramsey Numbers for Graphs of Small Bandwidth.
Electron. J. Comb., 2018

2017
Characterization of Digraphic Sequences with Strongly Connected Realizations.
J. Graph Theory, 2017

2016
Degree condition for completely independent spanning trees.
Inf. Process. Lett., 2016

Ore-type degree condition of supereulerian digraphs.
Discret. Math., 2016

Fractional spanning tree packing, forest covering and eigenvalues.
Discret. Appl. Math., 2016

2014
Supereulerian digraphs.
Discret. Math., 2014

Ore's condition for completely independent spanning trees.
Discret. Appl. Math., 2014

Using Symmetry Dicke State as Security Detection Particle in Quantum "Ping-Pong" Protocol.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

A Privacy-Preserving Data Publishing Method for Multiple Numerical Sensitive Attributes via Clustering and Multi-sensitive Bucketization.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014

2013
Optimally restricted edge connected elementary Harary graphs.
Theor. Comput. Sci., 2013

2012
A New Proof for Zassenhaus-Groemer-Oler inequality.
Discret. Math. Algorithms Appl., 2012

2011
On minimum submodular cover with submodular cost.
J. Glob. Optim., 2011

Cyclic Connectivity of Star Graph.
Discret. Math. Algorithms Appl., 2011

Restricted Edge Connectivity of Harary Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Sufficient conditions for a graph to be lambda<sub><i>k</i></sub>-optimal with given girth and diameter.
Networks, 2010

The existence and upper bound for two types of restricted connectivity.
Discret. Appl. Math., 2010

Cyclic Vertex Connectivity of Star Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Two Algorithms for Connected R-Hop k-Dominating Set.
Discret. Math. Algorithms Appl., 2009

Edges of degree k in minimally restricted k-edge connected graphs.
Discret. Math., 2009

Minimally 3-restricted edge connected graphs.
Discret. Appl. Math., 2009

2008
Minimally restricted edge connected graphs.
Appl. Math. Lett., 2008


  Loading...