Xiangqian Zhou

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 28

Top Topics

Selection Algorithm

Replica Selection

Information Dissemination

Top Venues

Discret. Appl. Math.

Publications

Wanchun Jiang, Yujia Qiu, Fa Ji, Yongjia Zhang, Xiangqian Zhou, Jianxin Wang
AMS: Adaptive Multiget Scheduling Algorithm for Distributed Key-Value Stores. IEEE Trans. Cloud Comput. 11 (3) (2023)
Wanchun Jiang, Yujia Qiu, Yucheng Chen, Fa Ji, HaiMing Xie, Xiangqian Zhou, Jialiang Chen, Jiawei Huang, Jianxin Wang, Yan Li
Accelerated Information Dissemination for Replica Selection in Distributed Key-Value Store Systems. IEEE Trans. Parallel Distributed Syst. 34 (1) (2023)
Mingfang Huang, Guorong Liu, Xiangqian Zhou
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven. Graphs Comb. 39 (6) (2023)
Xiangqian Zhou, Heping Zhang
Some novel minimax results for perfect matchings of hexagonal systems. Discret. Appl. Math. 320 (2022)
Lily Chen, Yanyi Li, Xiangqian Zhou
The inclusion-free edge-colorings of (3, Δ)-bipartite graphs. Discret. Appl. Math. 321 (2022)
Meiqin Wei, Changxiang He, Yaping Mao, Xiangqian Zhou
and monochromatic fans or wheels. Discret. Math. 345 (11) (2022)
Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343 (4) (2020)
João Paulo Costalonga, Xiangqian Zhou
Triangle-roundedness in matroids. Discret. Math. 343 (2) (2020)
Lily Chen, Shumei Chen, Ren Zhao, Xiangqian Zhou
The strong chromatic index of graphs with edge weight eight. J. Comb. Optim. 40 (1) (2020)
Wanchun Jiang, Fa Ji, HaiMing Xie, Xiangqian Zhou, Jianxin Wang
Information Dissemination for the Adaptive Replica Selection algorithm in Key-Value Stores. ICC (2020)
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 (2019)
Wanchun Jiang, HaiMing Xie, Xiangqian Zhou, Liyuan Fang, Jianxin Wang
Haste makes waste: The On-Off algorithm for replica selection in key-value stores. J. Parallel Distributed Comput. 130 (2019)
Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342 (2) (2019)
Kecai Deng, Gexin Yu, Xiangqian Zhou
Recent progress on strong edge-coloring of graphs. Discret. Math. Algorithms Appl. 11 (5) (2019)
Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou
DP-4-colorability of two classes of planar graphs. Discret. Math. 342 (11) (2019)
Xiangqian Zhou
-Minor. Graphs Comb. 34 (3) (2018)
Adam Gray, Talmage James Reid, Xiangqian Zhou
Clones in matroids representable over a prime field. Discret. Math. 341 (1) (2018)
João Paulo Costalonga, Kecai Deng, Xiangqian Zhou
-Connected Matroids. Graphs Comb. 34 (6) (2018)
Wanchun Jiang, HaiMing Xie, Xiangqian Zhou, Liyuan Fang, Jianxin Wang
Performance Analysis and Improvement of Replica Selection Algorithms for Key-Value Stores. CLOUD (2017)
Wanchun Jiang, Liyuan Fang, HaiMing Xie, Xiangqian Zhou, Jianxin Wang
Tars: Timeliness-Aware Adaptive Replica Selection for Key-Value Stores. ICCCN (2017)
Wanchun Jiang, Liyuan Fang, HaiMing Xie, Xiangqian Zhou, Jianxin Wang
Tars: Timeliness-aware Adaptive Replica Selection for Key-Value Stores. CoRR (2017)
Liyuan Fang, Xiangqian Zhou, HaiMing Xie, Wanchun Jiang
PRS: Predication-Based Replica Selection Algorithm for Key-Value Stores. ICPCSEE (1) (2017)
Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong chromatic index of (3, Δ)-bipartite graphs. Discret. Math. 340 (5) (2017)
Heping Zhang, Xiangqian Zhou
A maximum resonant set of polyomino graphs. Discuss. Math. Graph Theory 36 (2) (2016)
Jesse T. Williams, Xiangqian Zhou
A New Proof for a Result of Kingan and Lemos'. Graphs Comb. 32 (1) (2016)
Xiangqian Zhou, Heping Zhang
A minimax result for perfect matchings of a polyomino graph. Discret. Appl. Math. 206 (2016)
Jakayla R. Robbins, Daniel C. Slilaty, Xiangqian Zhou
Clones in 3-connected frame matroids. Discret. Math. 339 (4) (2016)
Deborah Chun, Tyler Moss, Daniel C. Slilaty, Xiangqian Zhou
Bicircular matroids representable over GF(4) or GF(5). Discret. Math. 339 (9) (2016)
Daniel C. Slilaty, Xiangqian Zhou
Some minor-closed classes of signed graphs. Discret. Math. 313 (4) (2013)
Xiangqian Zhou, Bing Yao, Xiangen Chen
Every lobster is odd-elegant. Inf. Process. Lett. 113 (1-2) (2013)
Xiangqian Zhou, Bing Yao, Xiangen Chen, Haixia Tao
A proof to the odd-gracefulness of all lobsters. Ars Comb. 103 (2012)
Xiangqian Zhou
Generating an internally 4-connected binary matroid from another. Discret. Math. 312 (15) (2012)
Xue Li, Chi Zhou, Xiangqian Zhou, Zhiqiang Wu, Bing Xie
PAPR Analysis for SOFDM and NC-SOFDM Systems in Cognitive Radio. WASA (2010)
Talmage James Reid, Jakayla R. Robbins, Haidong Wu, Xiangqian Zhou
Clonal sets in GF(q)-representable matroids. Discret. Math. 310 (17-18) (2010)
Talmage James Reid, Xiangqian Zhou
On clone sets of GF(q)-representable matroids. Discret. Math. 309 (6) (2009)
Hongxun Qin, Daniel C. Slilaty, Xiangqian Zhou
The Regular Excluded Minors for Signed-Graphic Matroids. Comb. Probab. Comput. 18 (6) (2009)
Loni Delaplane, Talmage James Reid, Haidong Wu, Xiangqian Zhou
On minor-minimally 3-connected binary matroids. Discret. Math. 309 (10) (2009)
Talmage James Reid, Haidong Wu, Xiangqian Zhou
On minimally k-connected matroids. J. Comb. Theory, Ser. B 98 (6) (2008)
Jim Geelen, Xiangqian Zhou
Generating weakly 4-connected matroids. J. Comb. Theory, Ser. B 98 (3) (2008)
Xiangqian Zhou
)-minor. J. Comb. Theory, Ser. B 98 (1) (2008)
Mark E. Watkins, Xiangqian Zhou
Distinguishability of Locally Finite Trees. Electron. J. Comb. 14 (1) (2007)
Jim Geelen, Xiangqian Zhou
A Splitter Theorem for Internally 4-Connected Binary Matroids. SIAM J. Discret. Math. 20 (3) (2006)
Hongxun Qin, Xiangqian Zhou
)-minor . J. Comb. Theory, Ser. B 90 (1) (2004)
Xiangqian Zhou
On internally 4-connected non-regular binary matroids. J. Comb. Theory, Ser. B 91 (2) (2004)