default search action
Xiangqian Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j38]Mingfang Huang, Guorong Liu, Xiangqian Zhou
:
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven. Graphs Comb. 39(6): 116 (2023) - [j37]Wanchun Jiang
AMS: Adaptive Multiget Scheduling Algorithm for Distributed Key-Value Stores. IEEE Trans. Cloud Comput. 11(3): 2591-2602 (2023) - [j36]Wanchun Jiang
Accelerated Information Dissemination for Replica Selection in Distributed Key-Value Store Systems. IEEE Trans. Parallel Distributed Syst. 34(1): 358-371 (2023) - 2022
- [j35]Xiangqian Zhou, Heping Zhang
Some novel minimax results for perfect matchings of hexagonal systems. Discret. Appl. Math. 320: 435-445 (2022) - [j34]Lily Chen
The inclusion-free edge-colorings of (3, Δ)-bipartite graphs. Discret. Appl. Math. 321: 159-164 (2022) - [j33]Meiqin Wei, Changxiang He, Yaping Mao
Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. Discret. Math. 345(11): 113092 (2022) - 2020
- [j32]João Paulo Costalonga, Xiangqian Zhou:
Triangle-roundedness in matroids. Discret. Math. 343(2): 111680 (2020) - [j31]Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou:
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343(4): 111779 (2020) - [j30]Lily Chen
The strong chromatic index of graphs with edge weight eight. J. Comb. Optim. 40(1): 227-233 (2020) - [c5]Wanchun Jiang, Fa Ji, HaiMing Xie, Xiangqian Zhou, Jianxin Wang:
Information Dissemination for the Adaptive Replica Selection algorithm in Key-Value Stores. ICC 2020: 1-6
2010 – 2019
- 2019
- [j29]Lily Chen, Kecai Deng, Gexin Yu
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342(2): 339-343 (2019) - [j28]Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. Discret. Math. 342(11): 2984-2993 (2019) - [j27]Kecai Deng, Gexin Yu, Xiangqian Zhou
Recent progress on strong edge-coloring of graphs. Discret. Math. Algorithms Appl. 11(5): 1950062:1-1950062:21 (2019) - [j26]Wanchun Jiang, HaiMing Xie, Xiangqian Zhou, Liyuan Fang, Jianxin Wang:
Understanding and improvement of the selection of replica servers in key-value stores. Inf. Syst. 83: 218-228 (2019) - [j25]Wanchun Jiang
Haste makes waste: The On-Off algorithm for replica selection in key-value stores. J. Parallel Distributed Comput. 130: 80-90 (2019) - 2018
- [j24]Adam Gray, Talmage James Reid, Xiangqian Zhou
Clones in matroids representable over a prime field. Discret. Math. 341(1): 213-216 (2018) - [j23]Xiangqian Zhou
On Binary Matroids Without a P10-Minor. Graphs Comb. 34(3): 427-441 (2018) - [j22]João Paulo Costalonga, Kecai Deng, Xiangqian Zhou
On Critical Circuits in k-Connected Matroids. Graphs Comb. 34(6): 1589-1595 (2018) - 2017
- [j21]Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong chromatic index of (3, Δ)-bipartite graphs. Discret. Math. 340(5): 1143-1149 (2017) - [c4]Wanchun Jiang, HaiMing Xie, Xiangqian Zhou, Liyuan Fang, Jianxin Wang:
Performance Analysis and Improvement of Replica Selection Algorithms for Key-Value Stores. CLOUD 2017: 786-789 - [c3]Wanchun Jiang, Liyuan Fang, HaiMing Xie, Xiangqian Zhou, Jianxin Wang:
Tars: Timeliness-Aware Adaptive Replica Selection for Key-Value Stores. ICCCN 2017: 1-9 - [c2]Liyuan Fang, Xiangqian Zhou, HaiMing Xie, Wanchun Jiang:
PRS: Predication-Based Replica Selection Algorithm for Key-Value Stores. ICPCSEE (1) 2017: 317-330 - [i1]Wanchun Jiang, Liyuan Fang, HaiMing Xie, Xiangqian Zhou, Jianxin Wang:
Tars: Timeliness-aware Adaptive Replica Selection for Key-Value Stores. CoRR abs/1702.08172 (2017) - 2016
- [j20]Xiangqian Zhou, Heping Zhang
A minimax result for perfect matchings of a polyomino graph. Discret. Appl. Math. 206: 165-171 (2016) - [j19]Jakayla R. Robbins, Daniel C. Slilaty, Xiangqian Zhou
Clones in 3-connected frame matroids. Discret. Math. 339(4): 1329-1334 (2016) - [j18]Deborah Chun, Tyler Moss, Daniel C. Slilaty, Xiangqian Zhou:
Bicircular matroids representable over GF(4) or GF(5). Discret. Math. 339(9): 2239-2248 (2016) - [j17]Heping Zhang
A maximum resonant set of polyomino graphs. Discuss. Math. Graph Theory 36(2): 323-337 (2016) - [j16]Jesse T. Williams, Xiangqian Zhou:
A New Proof for a Result of Kingan and Lemos'. Graphs Comb. 32(1): 403-417 (2016) - 2013
- [j15]Daniel C. Slilaty, Xiangqian Zhou:
Some minor-closed classes of signed graphs. Discret. Math. 313(4): 313-325 (2013) - [j14]Xiangqian Zhou, Bing Yao, Xiangen Chen:
Every lobster is odd-elegant. Inf. Process. Lett. 113(1-2): 30-33 (2013) - 2012
- [j13]Xiangqian Zhou, Bing Yao, Xiangen Chen, Haixia Tao:
A proof to the odd-gracefulness of all lobsters. Ars Comb. 103: 13-18 (2012) - [j12]Xiangqian Zhou:
Generating an internally 4-connected binary matroid from another. Discret. Math. 312(15): 2375-2387 (2012) - 2010
- [j11]Talmage James Reid, Jakayla R. Robbins, Haidong Wu, Xiangqian Zhou:
Clonal sets in GF(q)-representable matroids. Discret. Math. 310(17-18): 2389-2397 (2010) - [c1]Xue Li, Chi Zhou, Xiangqian Zhou, Zhiqiang Wu, Bing Xie:
PAPR Analysis for SOFDM and NC-SOFDM Systems in Cognitive Radio. WASA 2010: 209-219
2000 – 2009
- 2009
- [j10]Hongxun Qin, Daniel C. Slilaty, Xiangqian Zhou:
The Regular Excluded Minors for Signed-Graphic Matroids. Comb. Probab. Comput. 18(6): 953-978 (2009) - [j9]Talmage James Reid, Xiangqian Zhou:
On clone sets of GF(q)-representable matroids. Discret. Math. 309(6): 1740-1745 (2009) - [j8]Loni Delaplane, Talmage James Reid, Haidong Wu, Xiangqian Zhou:
On minor-minimally 3-connected binary matroids. Discret. Math. 309(10): 3249-3254 (2009) - 2008
- [j7]Xiangqian Zhou:
A note on binary matroid with no M(K3, 3)-minor. J. Comb. Theory B 98(1): 235-238 (2008) - [j6]Jim Geelen, Xiangqian Zhou:
Generating weakly 4-connected matroids. J. Comb. Theory B 98(3): 538-557 (2008) - [j5]Talmage James Reid, Haidong Wu, Xiangqian Zhou:
On minimally k-connected matroids. J. Comb. Theory B 98(6): 1311-1324 (2008) - 2007
- [j4]Mark E. Watkins, Xiangqian Zhou:
Distinguishability of Locally Finite Trees. Electron. J. Comb. 14(1) (2007) - 2006
- [j3]Jim Geelen, Xiangqian Zhou:
A Splitter Theorem for Internally 4-Connected Binary Matroids. SIAM J. Discret. Math. 20(3): 578-587 (2006) - 2004
- [j2]Hongxun Qin, Xiangqian Zhou:
The class of binary matroids with no M(K3, 3)-, M ast (K3, 3)-, M(K5)- or M ast (K5)-minor . J. Comb. Theory B 90(1): 173-184 (2004) - [j1]Xiangqian Zhou:
On internally 4-connected non-regular binary matroids. J. Comb. Theory B 91(2): 327-343 (2004)
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-06-10 20:25 CEST 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: