On the existence of (v, 7, 1)-perfect Mendelsohn designs. - Frank E. Bennett; Beiliang Du; Lie Zhu (Discret. Math., 1990)

A few more RBIBDs with k = 5 and lambda = 1. - Lie Zhu; Beiliang Du; Xuebin Zhang (Discret. Math., 1991)

More mutually orthogonal Latin squares. - Beiliang Du (Australas. J Comb., 1992)

New bounds for pairwise orthogonal diagonal Latin squares. - Beiliang Du (Australas. J Comb., 1993)

On the existence of self-orthogonal diagonal Latin squares. - Beiliang Du (Australas. J Comb., 1994)

A few more BIBDs with k=8 or 9. - Beiliang Du (Australas. J Comb., 1994)

On the existence of incomplete transversal designs with block size five. - Beiliang Du (Discret. Math., 1994)

On complementary path decompositions of the complete multigraph. - Beiliang Du (Australas. J Comb., 1995)

On the existence of three incomplete idempotent MOLS. - Beiliang Du (Australas. J Comb., 1995)

The existence of orthogonal diagonal Latin squares with subsquares. - Beiliang Du (Discret. Math., 1996)

K1, p2-factorization of complete bipartite graphs. - Beiliang Du (Discret. Math., 1998)

P3-factorization of complete bipartite symmetric digraphs. - Beiliang Du (Australas. J Comb., 1999)

The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. - Beiliang Du; W. D. Wallis (Ars Comb., 1999)

P2k-factorization of complete bipartite multigraphs. - Beiliang Du (Australas. J Comb., 2000)

The existence of bimatching designs. - Beiliang Du (Australas. J Comb., 2001)

K1, pq-factorization of complete bipartite graphs. - Beiliang Du (Australas. J Comb., 2002)

Kl, k-factorization of complete bipartite graphs. - Beiliang Du; Jian Wang 104 (Discret. Math., 2002)

The existence of three idempotent IMOLS. - R. Julian R. Abel; Beiliang Du (Discret. Math., 2003)

Existence of self-orthogonal diagonal Latin squares with a missing subsquare. - Frank E. Bennett; Beiliang Du; Hantao Zhang 001 (Discret. Math., 2003)

Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes. - Haitao Cao 001; Beiliang Du (Discret. Math., 2004)

The spectrum of optimal strong partially balanced designs with block size five. - Beiliang Du (Discret. Math., 2004)

Existence of optimal strong partially balanced designs with block size five. - Beiliang Du (Discret. Math., 2004)

Kp, q-factorization of the complete bipartite graph Km, n. - Jian Wang 104; Beiliang Du (Discret. Math., 2004)

Splitting balanced incomplete block designs. - Beiliang Du (Australas. J Comb., 2005)

The existence of resolvable Mendelsohn designs RMD({3, s*}, v). - Yan Zhang; Beiliang Du (Australas. J Comb., 2005)

Resolvable optimal strong partially balanced designs with block size four. - Beiliang Du (Discret. Math., 2005)

Existence of resolvable optimal strong partially balanced designs. - Beiliang Du (Discret. Appl. Math., 2006)

P5-factorization of complete bipartite graphs. - Jian Wang 104; Beiliang Du (Discret. Math., 2008)

Uniformly resolvable three-wise balanced designs with block sizes four and six. - Zhaoping Meng; Lijun Ji; Beiliang Du (Discret. Math., 2009)

The existence of augmented resolvable Steiner quadruple systems. - Zhaoping Meng; Lijun Ji; Beiliang Du (Discret. Math., 2010)

A new class of splitting 3-designs. - Miao Liang; Beiliang Du (Des. Codes Cryptogr., 2011)

Support sizes of threefold quadruple systems. - Miao Liang; Jian Wang 104; Beiliang Du (Discret. Math., 2011)

The Spectrum of Tetrahedral Quadruple Systems. - Jian Wang 104; Miao Liang; Beiliang Du (Graphs Comb., 2011)

A new class of 3-fold perfect splitting authentication codes. - Miao Liang; Beiliang Du (Des. Codes Cryptogr., 2012)

The last twenty orders of (1, 2)-resolvable Steiner quadruple systems. - Zhaoping Meng; Beiliang Du (Discret. Math., 2012)

(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems. - Zhaoping Meng; Jian Wang 104; Beiliang Du (Discret. Math., 2012)

On bipartite factorization of complete bipartite multigraphs. - Jing Shi; Jian Wang 104; Beiliang Du (Ars Comb., 2013)

The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups. - Zhaoping Meng; Beiliang Du (Graphs Comb., 2013)

P2k+1-factorization of symmetric complete bipartite multi-digraphs. - Jian Wang 104; Beiliang Du (Ars Comb., 2014)

A construction for t-fold perfect authentication codes with arbitration. - Miao Liang; Mingchao Li; Beiliang Du (Des. Codes Cryptogr., 2014)

Some new results on mutually orthogonal frequency squares. - Mingchao Li; Yan Zhang; Beiliang Du (Discret. Math., 2014)

A construction of t-fold perfect splitting authentication codes with equal deception probabilities. - Mingchao Li; Miao Liang; Beiliang Du (Cryptogr. Commun., 2015)

A new class of 2-fold perfect 4-splitting authentication codes. - Miao Liang; Sufang Jiang; Beiliang Du (Ars Comb., 2016)

A construction for optimal c-splitting authentication and secrecy codes. - Mingchao Li; Miao Liang; Beiliang Du; Jingyuan Chen (Des. Codes Cryptogr., 2018)