default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBeiliang Du
Person information
- affiliation: Suzhou University, Department of Mathematics, China
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j44]Mingchao Li, Miao Liang
, Beiliang Du, Jingyuan Chen:
A construction for optimal c-splitting authentication and secrecy codes. Des. Codes Cryptogr. 86(8): 1739-1755 (2018)- 2016
- [j43]Miao Liang, Sufang Jiang, Beiliang Du:
A new class of 2-fold perfect 4-splitting authentication codes. Ars Comb. 128: 175-189 (2016) - 2015
- [j42]Mingchao Li, Miao Liang, Beiliang Du:
A construction of t-fold perfect splitting authentication codes with equal deception probabilities. Cryptogr. Commun. 7(2): 207-215 (2015) - 2014
- [j41]Jian Wang, Beiliang Du:
P2k+1-factorization of symmetric complete bipartite multi-digraphs. Ars Comb. 113: 193-204 (2014) - [j40]Miao Liang, Mingchao Li, Beiliang Du:
A construction for t-fold perfect authentication codes with arbitration. Des. Codes Cryptogr. 73(3): 781-790 (2014) - [j39]Mingchao Li, Yan Zhang, Beiliang Du:
Some new results on mutually orthogonal frequency squares. Discret. Math. 331: 175-187 (2014) - 2013
- [j38]Jing Shi, Jian Wang, Beiliang Du:
On bipartite factorization of complete bipartite multigraphs. Ars Comb. 108: 481-491 (2013) - [j37]Zhaoping Meng, Beiliang Du:
The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups. Graphs Comb. 29(5): 1501-1516 (2013) - 2012
- [j36]Miao Liang, Beiliang Du:
A new class of 3-fold perfect splitting authentication codes. Des. Codes Cryptogr. 62(1): 109-119 (2012) - [j35]Zhaoping Meng, Jian Wang, Beiliang Du:
(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems. Discret. Math. 312(12-13): 1968-1978 (2012) - [j34]Zhaoping Meng, Beiliang Du:
The last twenty orders of (1, 2)-resolvable Steiner quadruple systems. Discret. Math. 312(24): 3574-3584 (2012) - 2011
- [j33]Miao Liang, Beiliang Du:
A new class of splitting 3-designs. Des. Codes Cryptogr. 60(3): 283-290 (2011) - [j32]Miao Liang, Jian Wang, Beiliang Du:
Support sizes of threefold quadruple systems. Discret. Math. 311(10-11): 804-816 (2011) - [j31]Jian Wang, Miao Liang, Beiliang Du:
The Spectrum of Tetrahedral Quadruple Systems. Graphs Comb. 27(4): 593-602 (2011) - 2010
- [j30]Zhaoping Meng, Lijun Ji, Beiliang Du:
The existence of augmented resolvable Steiner quadruple systems. Discret. Math. 310(13-14): 2007-2020 (2010)
2000 – 2009
- 2009
- [j29]Zhaoping Meng, Lijun Ji, Beiliang Du:
Uniformly resolvable three-wise balanced designs with block sizes four and six. Discret. Math. 309(23-24): 6470-6482 (2009) - 2008
- [j28]Jian Wang, Beiliang Du:
P5-factorization of complete bipartite graphs. Discret. Math. 308(9): 1665-1673 (2008) - 2006
- [j27]Beiliang Du:
Existence of resolvable optimal strong partially balanced designs. Discret. Appl. Math. 154(6): 930-941 (2006) - 2005
- [j26]Beiliang Du:
Splitting balanced incomplete block designs. Australas. J Comb. 31: 287-298 (2005) - [j25]Yan Zhang, Beiliang Du:
The existence of resolvable Mendelsohn designs RMD({3, s*}, v). Australas. J Comb. 32: 197-204 (2005) - [j24]Beiliang Du:
Resolvable optimal strong partially balanced designs with block size four. Discret. Math. 305(1-3): 136-153 (2005) - 2004
- [j23]Beiliang Du:
Existence of optimal strong partially balanced designs with block size five. Discret. Math. 279(1-3): 173-190 (2004) - [j22]Haitao Cao, Beiliang Du:
Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes. Discret. Math. 281(1-3): 83-95 (2004) - [j21]Jian Wang, Beiliang Du:
Kp, q-factorization of the complete bipartite graph Km, n. Discret. Math. 283(1-3): 283-287 (2004) - [j20]Beiliang Du:
The spectrum of optimal strong partially balanced designs with block size five. Discret. Math. 288(1-3): 19-28 (2004) - 2003
- [j19]Frank E. Bennett, Beiliang Du, Hantao Zhang:
Existence of self-orthogonal diagonal Latin squares with a missing subsquare. Discret. Math. 261(1-3): 69-86 (2003) - [j18]R. Julian R. Abel, Beiliang Du:
The existence of three idempotent IMOLS. Discret. Math. 262(1-3): 1-16 (2003) - 2002
- [j17]Beiliang Du:
K1, pq-factorization of complete bipartite graphs. Australas. J Comb. 26: 85-92 (2002) - [j16]Beiliang Du, Jian Wang:
Kl, k-factorization of complete bipartite graphs. Discret. Math. 259(1-3): 301-306 (2002) - 2001
- [j15]Beiliang Du:
The existence of bimatching designs. Australas. J Comb. 23: 71-74 (2001) - 2000
- [j14]Beiliang Du:
P2k-factorization of complete bipartite multigraphs. Australas. J Comb. 21: 197-200 (2000)
1990 – 1999
- 1999
- [j13]Beiliang Du:
P3-factorization of complete bipartite symmetric digraphs. Australas. J Comb. 19: 275-278 (1999) - [j12]Beiliang Du, W. D. Wallis:
The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. Ars Comb. 53 (1999) - 1998
- [j11]Beiliang Du:
K1, p2-factorization of complete bipartite graphs. Discret. Math. 187(1-3): 273-279 (1998) - 1996
- [j10]Beiliang Du:
The existence of orthogonal diagonal Latin squares with subsquares. Discret. Math. 148(1-3): 37-48 (1996) - 1995
- [j9]Beiliang Du:
On complementary path decompositions of the complete multigraph. Australas. J Comb. 11: 211-214 (1995) - [j8]Beiliang Du:
On the existence of three incomplete idempotent MOLS. Australas. J Comb. 12: 193-200 (1995) - 1994
- [j7]Beiliang Du:
On the existence of self-orthogonal diagonal Latin squares. Australas. J Comb. 10: 45-50 (1994) - [j6]Beiliang Du:
A few more BIBDs with k=8 or 9. Australas. J Comb. 10: 245-250 (1994) - [j5]Beiliang Du:
On the existence of incomplete transversal designs with block size five. Discret. Math. 135(1-3): 81-92 (1994) - 1993
- [j4]Beiliang Du:
New bounds for pairwise orthogonal diagonal Latin squares. Australas. J Comb. 7: 87-100 (1993) - 1992
- [j3]Beiliang Du:
More mutually orthogonal Latin squares. Australas. J Comb. 6: 3-6 (1992) - 1991
- [j2]Lie Zhu, Beiliang Du, Xuebin Zhang:
A few more RBIBDs with k = 5 and lambda = 1. Discret. Math. 97(1-3): 409-417 (1991) - 1990
- [j1]Frank E. Bennett, Beiliang Du, Lie Zhu:
On the existence of (v, 7, 1)-perfect Mendelsohn designs. Discret. Math. 84(3): 221-239 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
