default search action
Qinghai Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j43]Disi Lin, Chuandong Chen, Rongshan Wei, Qinghai Liu, Huan He, Ziran Zhu, Zhifeng Lin
, Jianli Chen:
Two stage Ordered Escape Routing combined with LP and heuristic algorithm for large scaled PCB. Integr. 100: 102270 (2025) - 2024
- [j42]Junhao Zhang, Qinghai Liu
Gallai's conjecture for 3-degenerated graphs. Discret. Math. 347(7): 114057 (2024) - [j41]Jingyuan Zhang, Xian'an Jin, Weigen Yan, Qinghai Liu:
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph. Discret. Math. 347(9): 114063 (2024) - [j40]Qinghai Liu
TanrsColour: Transformer-based medical image colourization with content and structure preservation. IET Image Process. 18(10): 2702-2714 (2024) - [j39]Lun Tang
Digital Twin-Enabled Efficient Federated Learning for Collision Warning in Intelligent Driving. IEEE Trans. Intell. Transp. Syst. 25(3): 2573-2585 (2024) - 2023
- [j38]Xiaodong Chen, Qinghai Liu, Xiwu Yang:
Two completely independent spanning trees of split graphs. Discret. Appl. Math. 340: 76-78 (2023) - [j37]Haiyang Liu, Qinghai Liu
Connectivity keeping trees in 3-connected or 3-edge-connected graphs. Discret. Math. 346(12): 113679 (2023) - [j36]Lun Tang
Equilibrated and Fast Resources Allocation for Massive and Diversified MTC Services Using Multiagent Deep Reinforcement Learning. IEEE Internet Things J. 10(1): 664-681 (2023) - [j35]Li Li
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. 10(12): 10708-10724 (2023) - [j34]Li Li
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. 10(15): 13370-13384 (2023) - [j33]Lun Tang
Digital-Twin-Assisted Resource Allocation for Network Slicing in Industry 4.0 and Beyond Using Distributed Deep Reinforcement Learning. IEEE Internet Things J. 10(19): 16989-17006 (2023) - [j32]Qinghai Liu
Deep Reinforcement Learning for Resource Demand Prediction and Virtual Function Network Migration in Digital Twin Network. IEEE Internet Things J. 10(21): 19102-19116 (2023) - [j31]Xiaoqiang He
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. 10(22): 19825-19838 (2023) - [c9]Chuandong Chen, Dishi Lin, Rongshan Wei, Qinghai Liu, Ziran Zhu, Jianli Chen:
Efficient Global Optimization for Large Scaled Ordered Escape Routing. ASP-DAC 2023: 535-540 - [c8]Qinghai Liu, Disi Lin, Chuandong Chen, Huan He, Jianli Chen, Yao-Wen Chang:
A Matching Based Escape Routing Algorithm with Variable Design Rules and Constraints. DAC 2023: 1-6 - [c7]Qinghai Liu, Qinfei Tang, Jiarui Chen, Chuandong Chen, Ziran Zhu, Huan He, Jianli Chen, Yao-Wen Chang:
Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints. DAC 2023: 1-6 - [c6]Xiaoqiang He, Qianbin Chen, Weili Wang, Tong Li, Li Li, Lun Tang, Qinghai Liu:
Stacked Broad Learning System Empowered FCL Assisted by DTN for Intrusion Detection in UAV Networks. GLOBECOM 2023: 5372-5377 - 2022
- [j30]Yanmei Hong, Qinghai Liu
Mader's conjecture for graphs with small connectivity. J. Graph Theory 101(3): 379-388 (2022) - 2021
- [j29]Juan Liu, Qinghai Liu, Xindong Zhang, Xing Chen:
Trail-connected tournaments. Appl. Math. Comput. 389: 125595 (2021) - [j28]Yanan Chu, Genghua Fan, Qinghai Liu:
On Gallai's conjecture for graphs with maximum degree 6. Discret. Math. 344(2): 112212 (2021) - [j27]Yanmei Hong, Qinghai Liu, Changhong Lu, Qingjie Ye
Connectivity keeping caterpillars and spiders in 2-connected graphs. Discret. Math. 344(3): 112236 (2021) - [j26]Qing Cui
Implications in rainbow forbidden subgraphs. Discret. Math. 344(4): 112267 (2021) - [j25]Guantao Chen, Yuan Chen, Qing Cui
The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs. J. Graph Theory 96(4): 554-577 (2021) - 2020
- [j24]Yanmei Hong, Qinghai Liu, Nannan Yu:
Edge decomposition of connected claw-free cubic graphs. Discret. Appl. Math. 284: 246-250 (2020) - [j23]Guantao Chen, Yuan Chen
The Chromatic Number of Graphs with No Induced Subdivision of K4. Graphs Comb. 36(3): 719-728 (2020) - [j22]Qinghai Liu
A characterization of nonfeasible sets in matching covered graphs. J. Graph Theory 95(4): 509-526 (2020) - [j21]Yuhong Sun
SIR Meta Distribution in the Heterogeneous and Hybrid Networks. Wirel. Commun. Mob. Comput. 2020: 8856459:1-8856459:13 (2020) - [c5]Jianli Chen, Ziran Zhu, Qinghai Liu, Yimin Zhang, Wenxing Zhu, Yao-Wen Chang:
Hamiltonian Path Based Mixed-Cell-Height Legalization for Neighbor Diffusion Effect Mitigation. DAC 2020: 1-6
2010 – 2019
- 2019
- [j20]Qinghai Liu, Yanmei Hong:
The reliability of lexicographic product digraphs. Appl. Math. Comput. 358: 449-454 (2019) - [j19]Qing Cui
2-bisections in claw-free cubic multigraphs. Discret. Appl. Math. 257: 325-330 (2019) - 2018
- [j18]Lili Shen, Qizhong Lin, Qinghai Liu:
Bipartite Ramsey Numbers for Graphs of Small Bandwidth. Electron. J. Comb. 25(2): 2 (2018) - [j17]Qinghai Liu, Xingxing Yu, Zhao Zhang:
Circumference of 3-connected cubic graphs. J. Comb. Theory B 128: 134-159 (2018) - 2017
- [j16]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Characterization of Digraphic Sequences with Strongly Connected Realizations. J. Graph Theory 84(2): 191-201 (2017) - 2016
- [j15]Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. Discret. Appl. Math. 213: 219-223 (2016) - [j14]Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Ore-type degree condition of supereulerian digraphs. Discret. Math. 339(8): 2042-2050 (2016) - [j13]Xia Hong, Qinghai Liu:
Degree condition for completely independent spanning trees. Inf. Process. Lett. 116(10): 644-648 (2016) - 2014
- [j12]Genghua Fan, Yanmei Hong, Qinghai Liu:
Ore's condition for completely independent spanning trees. Discret. Appl. Math. 177: 95-100 (2014) - [j11]Yanmei Hong, Hong-Jian Lai
Supereulerian digraphs. Discret. Math. 330: 87-95 (2014) - [c4]Qinghai Liu, Hong Shen, Yingpeng Sang:
A Privacy-Preserving Data Publishing Method for Multiple Numerical Sensitive Attributes via Clustering and Multi-sensitive Bucketization. PAAP 2014: 220-223 - [c3]Qinghai Liu, Hong Shen, Hui Tian, Yingpeng Sang:
Using Symmetry Dicke State as Security Detection Particle in Quantum "Ping-Pong" Protocol. PAAP 2014: 244-249 - 2013
- [j10]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Optimally restricted edge connected elementary Harary graphs. Theor. Comput. Sci. 497: 131-138 (2013) - 2012
- [j9]Qinghai Liu, Xiang Li, Lidong Wu, Hai Du, Zhao Zhang, Weili Wu, Xiaodong Hu, Yinfeng Xu:
A New Proof for Zassenhaus-Groemer-Oler inequality. Discret. Math. Algorithms Appl. 4(2) (2012) - 2011
- [j8]Qinghai Liu, Zhao Zhang, Zhihua Yu:
Cyclic Connectivity of Star Graph. Discret. Math. Algorithms Appl. 3(4): 433-442 (2011) - [j7]Hongjie Du, Weili Wu, Wonjun Lee, Qinghai Liu, Zhao Zhang, Ding-Zhu Du:
On minimum submodular cover with submodular cost. J. Glob. Optim. 50(2): 229-234 (2011) - [c2]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Restricted Edge Connectivity of Harary Graphs. COCOA 2011: 113-125 - 2010
- [j6]Qinghai Liu, Zhao Zhang:
The existence and upper bound for two types of restricted connectivity. Discret. Appl. Math. 158(5): 516-521 (2010) - [j5]Zhao Zhang, Qinghai Liu:
Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter. Networks 55(2): 119-124 (2010) - [c1]Zhihua Yu, Qinghai Liu, Zhao Zhang:
Cyclic Vertex Connectivity of Star Graphs. COCOA (1) 2010: 212-221
2000 – 2009
- 2009
- [j4]Qinghai Liu, Yanmei Hong, Zhao Zhang:
Minimally 3-restricted edge connected graphs. Discret. Appl. Math. 157(4): 685-690 (2009) - [j3]Yanmei Hong, Zhao Zhang, Qinghai Liu:
Edges of degree k in minimally restricted k-edge connected graphs. Discret. Math. 309(13): 4448-4455 (2009) - [j2]Zhao Zhang, Qinghai Liu, Deying Li:
Two Algorithms for Connected R-Hop k-Dominating Set. Discret. Math. Algorithms Appl. 1(4): 485-498 (2009) - 2008
- [j1]Yanmei Hong, Qinghai Liu, Zhao Zhang:
Minimally restricted edge connected graphs. Appl. Math. Lett. 21(8): 820-823 (2008)
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-12-10 20:50 CET 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: