![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jianguo Qian
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j49]Jianguo Qian
, Jinlong Ci
, Hai Tan, Wenwen Xu, Yang Jiao, Peiyou Chen:
Cloud Detection Method Based on Improved DeeplabV3+ Remote Sensing Image. IEEE Access 12: 9229-9242 (2024) - [j48]Huanshen Jia, Jianguo Qian
:
Menger-Type Connectivity of Line Graphs of Generalized Hypercubes With Faulty Edges. Comput. J. 67(6): 2118-2125 (2024) - [j47]Junxia Zhang, Jianguo Qian
, Sumin Huang
:
Minimum number of maximal dissociation sets in trees. Discret. Appl. Math. 346: 272-278 (2024) - [j46]Sumin Huang
, Jianguo Qian
, Wei Wang:
The list-coloring function of signed graphs. Discret. Math. 347(3): 113790 (2024) - [j45]Maoqun Wang
, Jianguo Qian
:
Degree sum condition for vertex-disjoint 5-cycles. Discuss. Math. Graph Theory 44(2): 555 (2024) - [c4]Wei Yu, Jianguo Qian, Ranyue Xu, Chenxing Jin, Haina Fang, Xianhai Shi:
Improving Substation Network Security with DevSecOps and AIOps. BigDataSecurity 2024: 113-118 - 2023
- [j44]Weijuan Zhang, Jianguo Qian
:
Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles. Appl. Math. Comput. 444: 127780 (2023) - [j43]Jiang Song, Jianguo Qian, Zhengjun Liu
, Yang Jiao, Jiahui Zhou, Yongrong Li, Yiming Chen, Jie Guo, Zhiqiang Wang:
Research on Arc Sag Measurement Methods for Transmission Lines Based on Deep Learning and Photogrammetry Technology. Remote. Sens. 15(10): 2533 (2023) - [c3]Jingyi Qiu, Aibo Song, Jiahui Jin, Tianbo Zhang, Jingyi Ding, Xiaolin Fang, Jianguo Qian:
Dependency-Aware Core Column Discovery for Table Understanding. ISWC 2023: 159-178 - 2022
- [j42]Chao Shi, Peter Frankl, Jianguo Qian:
On Non-Empty Cross-Intersecting Families. Comb. 42(Supplement 2): 1513-1525 (2022) - [j41]Tianlong Ma, Jianguo Qian, Chao Shi:
Maximum Size of a Graph with Given Fractional Matching Number. Electron. J. Comb. 29(3) (2022) - [j40]Xiangyu Ren
, Jianguo Qian, Sumin Huang
, Junxia Zhang:
The odd-valued chromatic polynomial of a signed graph. Discret. Math. 345(11): 113042 (2022) - [j39]Sumin Huang
, Jianguo Qian
:
The Maximum Number of Stars in a Graph Without Linear Forest. Graphs Comb. 38(6): 173 (2022) - [j38]Maoqun Wang
, Jianguo Qian:
Ramsey Numbers for Complete Graphs Versus Generalized Fans. Graphs Comb. 38(6): 186 (2022) - [j37]Jiang Song, Jianguo Qian, Yongrong Li, Zhengjun Liu
, Yiming Chen, Jianchang Chen:
Automatic Extraction of Power Lines from Aerial Images of Unmanned Aerial Vehicles. Sensors 22(17): 6431 (2022) - [j36]On-Hei Solomon Lo
, Jianguo Qian
:
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators. SIAM J. Discret. Math. 36(2): 1496-1501 (2022) - 2021
- [j35]Maoqun Wang
, Jianguo Qian:
Rainbow vertex-pancyclicity of strongly edge-colored graphs. Discret. Math. 344(1): 112164 (2021) - [c2]Mingjun Feng, Buqiong Xiao, Bo Yu, Jianguo Qian, Xinxin Zhang, Peidong Chen, Bo Li:
A Novel Deception Defense-Based Honeypot System for Power Grid Network. SmartCom 2021: 297-307 - 2020
- [j34]Wei Wang, Lihong Qiu, Jianguo Qian, Wei Wang:
Generalized Spectral Characterization of Mixed Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j33]Wei Wang
, Jianguo Qian:
A generalization of Noel-Reed-Wu Theorem to signed graphs. Discret. Math. 343(6): 111833 (2020) - [j32]Maoqun Wang
, Jianguo Qian:
An Ore-type condition for the existence of two disjoint cycles. Inf. Process. Lett. 159-160: 105957 (2020) - [j31]Wei Wang
, Jianguo Qian
, Zhidan Yan
:
Colorings versus list colorings of uniform hypergraphs. J. Graph Theory 95(3): 384-397 (2020)
2010 – 2019
- 2019
- [j30]Wei Wang
, Jianguo Qian:
Chromatic-Choosability of Hypergraphs with High Chromatic Number. Electron. J. Comb. 26(1): 1 (2019) - [j29]Xiangyu Ren, Jianguo Qian
:
Flow polynomials of a Signed Graph. Electron. J. Comb. 26(3): 3 (2019) - [j28]Wei Wang
, Jianguo Qian
, Toshiki Abe:
Alon-Tarsi Number and Modulo Alon-Tarsi Number of Signed Graphs. Graphs Comb. 35(5): 1051-1064 (2019) - [j27]Yin Chen, Jianguo Qian
:
Inclusion-exclusion by ordering-free cancellation. J. Comb. Theory A 162: 1-9 (2019) - [c1]Lifeng Liu, Lizong Zhang, Fengming Zhang, Jianguo Qian, Xinxin Zhang, Peidong Chen, Bo Li:
Coattention-Based Recurrent Neural Networks for Sentiment Analysis of Chinese Texts. SmartCom 2019: 349-356 - 2018
- [j26]Guoliang Hao, Jianguo Qian
:
Bounds on the domination number of a digraph. J. Comb. Optim. 35(1): 64-74 (2018) - 2017
- [j25]Wei Wang
, Jianguo Qian
, Zhidan Yan
:
Towards a Version of Ohba's Conjecture for Improper Colorings. Graphs Comb. 33(2): 489-501 (2017) - [j24]Wei Wang, Xiaoping Li, Xiang-Gen Xia, Wenjie Wang, Jianguo Qian:
Simplification on Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers. Integers 17: A28 (2017) - [j23]Wei Wang
, Jianguo Qian
, Zhidan Yan
:
When does the list-coloring function of a graph equal its chromatic polynomial. J. Comb. Theory B 122: 543-549 (2017) - 2016
- [j22]Guoliang Hao, Jianguo Qian
:
On the Rainbow Domination Number of Digraphs. Graphs Comb. 32(5): 1903-1913 (2016) - [j21]Xiaoling Zhang, Jianguo Qian
:
L(p, q)-labeling and integer tension of a graph embedded on torus. J. Comb. Optim. 31(1): 67-77 (2016) - [j20]Xiaoling Zhang, Jianguo Qian
:
Erratum to: L(p, q)-labeling and integer tension of a graph embedded on torus. J. Comb. Optim. 31(1): 78 (2016) - 2015
- [j19]Guoliang Hao, Jianguo Qian:
On the sum of out-domination number and in-domination number of digraphs. Ars Comb. 119: 331-337 (2015) - 2014
- [j18]Jianguo Qian
:
Enumeration of unlabeled uniform hypergraphs. Discret. Math. 326: 66-74 (2014) - 2013
- [j17]Xiaoling Zhang, Jianguo Qian
:
L(p, q)-Labeling and Integer Flow on Planar Graphs. Comput. J. 56(6): 785-792 (2013) - [j16]Jianguo Qian:
Enumeration of Unlabeled Directed Hypergraphs. Electron. J. Comb. 20(1): 46 (2013) - [j15]Xiaodan Chen, Jianguo Qian
:
Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings. Graphs Comb. 29(5): 1249-1257 (2013) - [j14]Yu Kuang, Guillem Pratx
, Magdalena Bazalova
, Bowen Meng, Jianguo Qian, Lei Xing
:
First Demonstration of Multiplexed X-Ray Fluorescence Computed Tomography (XFCT) Imaging. IEEE Trans. Medical Imaging 32(2): 262-267 (2013) - 2010
- [j13]Jianguo Qian
, Fuji Zhang:
Counting the cyclocized polyphenacenes. J. Comput. Chem. 31(14): 2577-2584 (2010)
2000 – 2009
- 2009
- [j12]Xiaodan Chen, Jianguo Qian
:
Conjugated trees with minimum general Randic index. Discret. Appl. Math. 157(7): 1379-1386 (2009) - [j11]Jianguo Qian
, Konrad Engel, Wei Xu:
A generalization of Sperner's theorem and an application to graph orientations. Discret. Appl. Math. 157(9): 2170-2176 (2009) - [j10]Meirun Chen, Jianguo Qian
:
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes. Inf. Process. Lett. 109(15): 828-831 (2009) - 2008
- [j9]Li Sun, Fuji Zhang, Jianguo Qian
:
Multi-hop all-to-all optical routings in Cartesian product networks. Inf. Process. Lett. 107(6): 252-256 (2008) - 2007
- [j8]Jianguo Qian
, Andreas W. M. Dress, Yan Wang:
On the dependence polynomial of a graph. Eur. J. Comb. 28(1): 337-346 (2007) - 2006
- [j7]Jianguo Qian
:
Degree complete graphs. Discret. Math. 306(5): 533-537 (2006) - [j6]Jianguo Qian
, Hong Lin:
Graph colourings and solutions of systems of equations over finite fields. Discret. Math. 306(18): 2257-2262 (2006) - [j5]Jianguo Qian
:
Induced Matching Extendable Graph Powers. Graphs Comb. 22(3): 391-398 (2006) - 2004
- [j4]Jianguo Qian
, Fuji Zhang:
Expanding and forwarding parameters of product graphs. Discret. Appl. Math. 136(1): 63-82 (2004)
1990 – 1999
- 1999
- [j3]Jianguo Qian:
Two classes of extreme graphs related to the maximum degree of an interchange graph. Australas. J Comb. 19: 3-10 (1999) - [j2]Jianguo Qian
:
On the upper bound of the diameter of interchange graphs. Discret. Math. 195(1-3): 277-285 (1999)
1980 – 1989
- 1987
- [j1]Seshadri Mohan
, Jianguo Qian, Nagendra L. Rao:
Efficient point-to-point and point-to-multipoint selective-repeat ARQ schemes with multiple retransmissions: a throughput analysis. Comput. Commun. Rev. 17(5): 49-57 (1987)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint