The class of binary matroids with no M(K3, 3)-, M ast (K3, 3)-, M(K5)- or M ast (K5)-minor . - Hongxun Qin; Xiangqian Zhou (J. Comb. Theory B, 2004)

On internally 4-connected non-regular binary matroids. - Xiangqian Zhou (J. Comb. Theory B, 2004)

A Splitter Theorem for Internally 4-Connected Binary Matroids. - Jim Geelen; Xiangqian Zhou (SIAM J. Discret. Math., 2006)

Distinguishability of Locally Finite Trees. - Mark E. Watkins; Xiangqian Zhou (Electron. J. Comb., 2007)

Generating weakly 4-connected matroids. - Jim Geelen; Xiangqian Zhou (J. Comb. Theory B, 2008)

On minimally k-connected matroids. - Talmage James Reid; Haidong Wu; Xiangqian Zhou (J. Comb. Theory B, 2008)

A note on binary matroid with no M(K3, 3)-minor. - Xiangqian Zhou (J. Comb. Theory B, 2008)

The Regular Excluded Minors for Signed-Graphic Matroids. - Hongxun Qin; Daniel C. Slilaty; Xiangqian Zhou (Comb. Probab. Comput., 2009)

On minor-minimally 3-connected binary matroids. - Loni Delaplane; Talmage James Reid; Haidong Wu; Xiangqian Zhou (Discret. Math., 2009)

On clone sets of GF(q)-representable matroids. - Talmage James Reid; Xiangqian Zhou (Discret. Math., 2009)

PAPR Analysis for SOFDM and NC-SOFDM Systems in Cognitive Radio. - Xue Li 002; Chi Zhou; Xiangqian Zhou; Zhiqiang Wu 001; Bing Xie (WASA, 2010)

Clonal sets in GF(q)-representable matroids. - Talmage James Reid; Jakayla R. Robbins; Haidong Wu; Xiangqian Zhou (Discret. Math., 2010)

A proof to the odd-gracefulness of all lobsters. - Xiangqian Zhou; Bing Yao; Xiangen Chen; Haixia Tao (Ars Comb., 2012)

Generating an internally 4-connected binary matroid from another. - Xiangqian Zhou (Discret. Math., 2012)

Some minor-closed classes of signed graphs. - Daniel C. Slilaty; Xiangqian Zhou (Discret. Math., 2013)

Every lobster is odd-elegant. - Xiangqian Zhou; Bing Yao; Xiangen Chen (Inf. Process. Lett., 2013)

A minimax result for perfect matchings of a polyomino graph. - Xiangqian Zhou; Heping Zhang (Discret. Appl. Math., 2016)

Bicircular matroids representable over GF(4) or GF(5). - Deborah Chun; Tyler Moss; Daniel C. Slilaty; Xiangqian Zhou (Discret. Math., 2016)

Clones in 3-connected frame matroids. - Jakayla R. Robbins; Daniel C. Slilaty; Xiangqian Zhou (Discret. Math., 2016)

A maximum resonant set of polyomino graphs. - Heping Zhang; Xiangqian Zhou (Discuss. Math. Graph Theory, 2016)

A New Proof for a Result of Kingan and Lemos'. - Jesse T. Williams; Xiangqian Zhou (Graphs Comb., 2016)

Performance Analysis and Improvement of Replica Selection Algorithms for Key-Value Stores. - Wanchun Jiang; HaiMing Xie; Xiangqian Zhou; Liyuan Fang; Jianxin Wang 001 (CLOUD, 2017)

Tars: Timeliness-Aware Adaptive Replica Selection for Key-Value Stores. - Wanchun Jiang; Liyuan Fang; HaiMing Xie; Xiangqian Zhou; Jianxin Wang 001 (ICCCN, 2017)

PRS: Predication-Based Replica Selection Algorithm for Key-Value Stores. - Liyuan Fang; Xiangqian Zhou; HaiMing Xie; Wanchun Jiang (ICPCSEE (1), 2017)

The strong chromatic index of (3, Δ)-bipartite graphs. - Mingfang Huang; Gexin Yu; Xiangqian Zhou (Discret. Math., 2017)

Clones in matroids representable over a prime field. - Adam Gray; Talmage James Reid; Xiangqian Zhou (Discret. Math., 2018)

On Critical Circuits in k-Connected Matroids. - João Paulo Costalonga; Kecai Deng; Xiangqian Zhou (Graphs Comb., 2018)

On Binary Matroids Without a P10-Minor. - Xiangqian Zhou (Graphs Comb., 2018)

Strong edge-coloring for planar graphs with large girth. - Lily Chen; Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math., 2019)

DP-4-colorability of two classes of planar graphs. - Lily Chen; Runrun Liu; Gexin Yu; Ren Zhao; Xiangqian Zhou (Discret. Math., 2019)

Recent progress on strong edge-coloring of graphs. - Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math. Algorithms Appl., 2019)

Understanding and improvement of the selection of replica servers in key-value stores. - Wanchun Jiang; HaiMing Xie; Xiangqian Zhou; Liyuan Fang; Jianxin Wang 001 (Inf. Syst., 2019)

Haste makes waste: The On-Off algorithm for replica selection in key-value stores. - Wanchun Jiang; HaiMing Xie; Xiangqian Zhou; Liyuan Fang; Jianxin Wang 001 (J. Parallel Distributed Comput., 2019)

Information Dissemination for the Adaptive Replica Selection algorithm in Key-Value Stores. - Wanchun Jiang; Fa Ji; HaiMing Xie; Xiangqian Zhou; Jianxin Wang 001 (ICC, 2020)

The strong edge-coloring for graphs with small edge weight. - Lily Chen; Mingfang Huang; Gexin Yu; Xiangqian Zhou (Discret. Math., 2020)

Triangle-roundedness in matroids. - João Paulo Costalonga; Xiangqian Zhou (Discret. Math., 2020)

The strong chromatic index of graphs with edge weight eight. - Lily Chen; Shumei Chen; Ren Zhao; Xiangqian Zhou (J. Comb. Optim., 2020)

The inclusion-free edge-colorings of (3, Δ)-bipartite graphs. - Lily Chen; Yanyi Li; Xiangqian Zhou (Discret. Appl. Math., 2022)

Some novel minimax results for perfect matchings of hexagonal systems. - Xiangqian Zhou; Heping Zhang (Discret. Appl. Math., 2022)

Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. - Meiqin Wei; Changxiang He; Yaping Mao; Xiangqian Zhou (Discret. Math., 2022)

AMS: Adaptive Multiget Scheduling Algorithm for Distributed Key-Value Stores. - Wanchun Jiang; Yujia Qiu; Fa Ji; Yongjia Zhang; Xiangqian Zhou; Jianxin Wang 001 (IEEE Trans. Cloud Comput., 2023)

Accelerated Information Dissemination for Replica Selection in Distributed Key-Value Store Systems. - Wanchun Jiang; Yujia Qiu; Yucheng Chen; Fa Ji; HaiMing Xie; Xiangqian Zhou; Jialiang Chen; Jiawei Huang 001; Jianxin Wang 001; Yan Li (IEEE Trans. Parallel Distributed Syst., 2023)

Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven. - Mingfang Huang; Guorong Liu; Xiangqian Zhou (Graphs Comb., 2023)

On the Rich-Neighbor Edge-Colorings of Subcubic Graphs. - Lily Chen; Yi Tan; Xiangqian Zhou (Graphs Comb., 2025)

On the (1,25)-packing edge-colorings of claw-free subcubic graphs. - Lily Chen; Kecai Deng; Chenghao Nan; Yi Tan; Xiangqian Zhou (Discret. Math., 2026)