Kirkman Packing Designs KPD ({3, 5*}, v). - Haitao Cao 001; Lie Zhu (Des. Codes Cryptogr., 2002)

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

On Kirkman packing designs KPD({3, 4}, v). - Haitao Cao 001; Y. Tang (Discret. Math., 2004)

Large sets of disjoint packings on 6k+5 points. - Haitao Cao 001; L. Ji; Zhu Lie (J. Comb. Theory A, 2004)

Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2). - Haitao Cao 001 (Discret. Math., 2006)

Constructions for generalized Steiner systems GS (3, 4, v , 2). - Haitao Cao 001; Lijun Ji; Lie Zhu (Des. Codes Cryptogr., 2007)

On orthogonal generalized equitable rectangles. - Haitao Cao 001; Jeffrey H. Dinitz; Donald L. Kreher; Douglas R. Stinson; Ruizhong Wei (Des. Codes Cryptogr., 2009)

Super-simple balanced incomplete block designs with block size 4 and index 5. - Haitao Cao 001; Kejun Chen; Ruizhong Wei (Discret. Math., 2009)

The existence of HGDDs with block size four and its application to double frames. - Haitao Cao 001; L. Wang; Ruizhong Wei (Discret. Math., 2009)

Super-simple group divisible designs with block size 4 and index 5. - Haitao Cao 001; F. Yan (Discret. Math., 2009)

Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes. - Haitao Cao 001; Ruizhong Wei (IEEE Trans. Inf. Theory, 2009)

Existence of strong symmetric self-orthogonal diagonal Latin squares. - Haitao Cao 001; Wen Li (Discret. Math., 2011)

On the existence of cycle frames and almost resolvable cycle systems. - Haitao Cao 001; Meixin Niu; C. Tang (Discret. Math., 2011)

More results on cycle frames and almost resolvable cycle systems. - Meixin Niu; Haitao Cao 001 (Discret. Math., 2012)

Constructions of large sets of disjoint group-divisible designs using a generalization of. - Haitao Cao 001; J. Lei; Lie Zhu (Discret. Math., 2015)

On the existence of holey 4-cycle frames. - Feifei Lu; Haitao Cao 001 (Discret. Math., 2015)

Optimal Placement Delivery Arrays. - Minquan Cheng; Jing Jiang 003; Qifa Yan; Xiaohu Tang; Haitao Cao 001 (CoRR, 2016)

Some bounds of separating hash families. - Xiaolei Niu; Haitao Cao 001 (CoRR, 2016)

Uniformly resolvable decompositions of Kv into K2 and K1, 3 graphs. - Fen Chen; Haitao Cao 001 (Discret. Math., 2016)

On the existence of (K1, 3, λ)-frames of type gu. - Fen Chen; Haitao Cao 001 (Australas. J Comb., 2017)

Some new bounds of placement delivery arrays. - Xiaolei Niu; Haitao Cao 001 (CoRR, 2017)

Some results on generalized strong external difference families. - Xiaojuan Lu; Xiaolei Niu; Haitao Cao 001 (Des. Codes Cryptogr., 2018)

Constructions and bounds for separating hash families. - Xiaolei Niu; Haitao Cao 001 (Discret. Math., 2018)

A note on the Hamilton-Waterloo problem with C8-factors and Cm-factors. - L. Wang; Haitao Cao 001 (Discret. Math., 2018)

Completing the spectrum of almost resolvable cycle systems with odd cycle length. - L. Wang; Haitao Cao 001 (Discret. Math., 2018)

Binary periodic sequences with 2-level autocorrelation values. - Xiaolei Niu; Haitao Cao 001; Keqin Feng (Discret. Math., 2020)

Completing the spectrum for three designs related to the graph K4-e. - C. Shen; Y. Zheng; Haitao Cao 001 (Discret. Math., 2020)

On large set plus of disjoint incomplete Latin squares. - Cong Shen; Haitao Cao 001 (Discret. Math., 2022)

On a conjecture about (m1, m2)-near-Skolem sequences. - Fujie Zhang; Haitao Cao 001 (Discret. Math., 2023)

On a pair of orthogonal golf designs. - Hong Lu; Jianpeng Chen; Haitao Cao 001 (Discret. Math., 2023)

The existence of (1,m)-near-Skolem sequences. - Kunxuan Gu; Fujie Zhang; Haitao Cao 001 (Australas. J Comb., 2023)

New results on orthogonal arrays OA(3,5,4n + 2). - Dongliang Li; Haitao Cao 001 (J. Comb. Theory, Ser. A, 2024)

Further results on large sets plus of partitioned incomplete Latin squares. - Hong Lu; Haitao Cao 001 (Discret. Math., 2025)