Xiangqian Zhou

Orcid: 0000-0002-0662-4792

According to our database¹, Xiangqian Zhou authored at least 43 papers between 2004 and 2023.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven.

[BibT_eX]

[DOI]

Mingfang Huang

Guorong Liu

Xiangqian Zhou

Graphs Comb., December, 2023

Accelerated Information Dissemination for Replica Selection in Distributed Key-Value Store Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2023

AMS: Adaptive Multiget Scheduling Algorithm for Distributed Key-Value Stores.

[BibT_eX]

[DOI]

IEEE Trans. Cloud Comput., 2023

2022

Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels.

[BibT_eX]

[DOI]

Discret. Math., 2022

Some novel minimax results for perfect matchings of hexagonal systems.

[BibT_eX]

[DOI]

Xiangqian Zhou

Heping Zhang

Discret. Appl. Math., 2022

The inclusion-free edge-colorings of (3, Δ)-bipartite graphs.

[BibT_eX]

[DOI]

Lily Chen

Yanyi Li

Xiangqian Zhou

Discret. Appl. Math., 2022

2020

The strong chromatic index of graphs with edge weight eight.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Triangle-roundedness in matroids.

[BibT_eX]

[DOI]

João Paulo Costalonga

Xiangqian Zhou

Discret. Math., 2020

The strong edge-coloring for graphs with small edge weight.

[BibT_eX]

[DOI]

Discret. Math., 2020

Information Dissemination for the Adaptive Replica Selection algorithm in Key-Value Stores.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019

Haste makes waste: The On-Off algorithm for replica selection in key-value stores.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

Understanding and improvement of the selection of replica servers in key-value stores.

[BibT_eX]

[DOI]

Inf. Syst., 2019

Recent progress on strong edge-coloring of graphs.

[BibT_eX]

[DOI]

Kecai Deng

Gexin Yu

Xiangqian Zhou

Discret. Math. Algorithms Appl., 2019

DP-4-colorability of two classes of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

Strong edge-coloring for planar graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

On Binary Matroids Without a P10-Minor.

[BibT_eX]

[DOI]

Xiangqian Zhou

Graphs Comb., 2018

On Critical Circuits in k-Connected Matroids.

[BibT_eX]

[DOI]

João Paulo Costalonga

Kecai Deng

Xiangqian Zhou

Graphs Comb., 2018

Clones in matroids representable over a prime field.

[BibT_eX]

[DOI]

Adam Gray

Talmage James Reid

Xiangqian Zhou

Discret. Math., 2018

2017

The strong chromatic index of (3, Δ)-bipartite graphs.

[BibT_eX]

[DOI]

Mingfang Huang

Gexin Yu

Xiangqian Zhou

Discret. Math., 2017

PRS: Predication-Based Replica Selection Algorithm for Key-Value Stores.

[BibT_eX]

[DOI]

Proceedings of the Data Science, 2017

Tars: Timeliness-Aware Adaptive Replica Selection for Key-Value Stores.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Performance Analysis and Improvement of Replica Selection Algorithms for Key-Value Stores.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), 2017

2016

A New Proof for a Result of Kingan and Lemos'.

[BibT_eX]

[DOI]

Jesse T. Williams

Xiangqian Zhou

Graphs Comb., 2016

A maximum resonant set of polyomino graphs.

[BibT_eX]

[DOI]

Heping Zhang

Xiangqian Zhou

Discuss. Math. Graph Theory, 2016

Clones in 3-connected frame matroids.

[BibT_eX]

[DOI]

Jakayla R. Robbins

Daniel C. Slilaty

Xiangqian Zhou

Discret. Math., 2016

Bicircular matroids representable over GF(4) or GF(5).

[BibT_eX]

[DOI]

Discret. Math., 2016

A minimax result for perfect matchings of a polyomino graph.

[BibT_eX]

[DOI]

Xiangqian Zhou

Heping Zhang

Discret. Appl. Math., 2016

2013

Every lobster is odd-elegant.

[BibT_eX]

[DOI]

Xiangqian Zhou

Bing Yao

Xiangen Chen

Inf. Process. Lett., 2013

Some minor-closed classes of signed graphs.

[BibT_eX]

[DOI]

Daniel C. Slilaty

Xiangqian Zhou

Discret. Math., 2013

2012

Generating an internally 4-connected binary matroid from another.

[BibT_eX]

[DOI]

Xiangqian Zhou

Discret. Math., 2012

A proof to the odd-gracefulness of all lobsters.

[BibT_eX]

Ars Comb., 2012

2010

Clonal sets in GF(q)-representable matroids.

[BibT_eX]

[DOI]

Discret. Math., 2010

PAPR Analysis for SOFDM and NC-SOFDM Systems in Cognitive Radio.

[BibT_eX]

[DOI]

Proceedings of the Wireless Algorithms, 2010

2009

On clone sets of GF(q)-representable matroids.

[BibT_eX]

[DOI]

Talmage James Reid

Xiangqian Zhou

Discret. Math., 2009

On minor-minimally 3-connected binary matroids.

[BibT_eX]

[DOI]

Discret. Math., 2009

The Regular Excluded Minors for Signed-Graphic Matroids.

[BibT_eX]

[DOI]

Hongxun Qin

Daniel C. Slilaty

Xiangqian Zhou

Comb. Probab. Comput., 2009

2008

A note on binary matroid with no M(K3, 3)-minor.

[BibT_eX]

[DOI]

Xiangqian Zhou

J. Comb. Theory, Ser. B, 2008

On minimally k-connected matroids.

[BibT_eX]

[DOI]

Talmage James Reid

Haidong Wu

Xiangqian Zhou

J. Comb. Theory, Ser. B, 2008

Generating weakly 4-connected matroids.

[BibT_eX]

[DOI]

Jim Geelen

Xiangqian Zhou

J. Comb. Theory, Ser. B, 2008

2007

Distinguishability of Locally Finite Trees.

[BibT_eX]

[DOI]

Mark E. Watkins

Xiangqian Zhou

Electron. J. Comb., 2007

2006

A Splitter Theorem for Internally 4-Connected Binary Matroids.

[BibT_eX]

[DOI]

Jim Geelen

Xiangqian Zhou

SIAM J. Discret. Math., 2006

2004

On internally 4-connected non-regular binary matroids.

[BibT_eX]

[DOI]

Xiangqian Zhou

J. Comb. Theory, Ser. B, 2004

The class of binary matroids with no M(K3, 3)-, M ast (K3, 3)-, M(K5)- or M ast (K5)-minor .

[BibT_eX]

[DOI]

Hongxun Qin

Xiangqian Zhou

J. Comb. Theory, Ser. B, 2004

Xiangqian Zhou

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...