default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Beiliang Du
Suzhou University, Department of Mathematics, China
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 45 matches
- 2019
- Shaohe Lu, Xuefeng Hu, Hua Zheng, Junwen Qiu, Renbing Tian, Wenjing Quan, Xinjie Min, Peng Ji, Yewei Hu, Suishi Cheng, Wei Du, Xiaoqiang Chen, Beiliang Cui, Xiaorong Wang, Wei Zhang:
Highly Selective, ppb-Level Xylene Gas Detection by Sn2+-Doped NiO Flower-Like Microspheres Prepared by a One-Step Hydrothermal Method. Sensors 19(13): 2958 (2019) - 2018
- 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
- Miao Liang, Sufang Jiang, Beiliang Du:
A new class of 2-fold perfect 4-splitting authentication codes. Ars Comb. 128: 175-189 (2016) - 2015
- 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
- Jian Wang, Beiliang Du:
P2k+1-factorization of symmetric complete bipartite multi-digraphs. Ars Comb. 113: 193-204 (2014) - Miao Liang, Mingchao Li, Beiliang Du:
A construction for t-fold perfect authentication codes with arbitration. Des. Codes Cryptogr. 73(3): 781-790 (2014) - Mingchao Li, Yan Zhang, Beiliang Du:
Some new results on mutually orthogonal frequency squares. Discret. Math. 331: 175-187 (2014) - 2013
- Jing Shi, Jian Wang, Beiliang Du:
On bipartite factorization of complete bipartite multigraphs. Ars Comb. 108: 481-491 (2013) - Zhaoping Meng, Beiliang Du:
The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups. Graphs Comb. 29(5): 1501-1516 (2013) - 2012
- Miao Liang, Beiliang Du:
A new class of 3-fold perfect splitting authentication codes. Des. Codes Cryptogr. 62(1): 109-119 (2012) - Zhaoping Meng, Beiliang Du:
The last twenty orders of (1, 2)-resolvable Steiner quadruple systems. Discret. Math. 312(24): 3574-3584 (2012) - Zhaoping Meng, Jian Wang, Beiliang Du:
(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems. Discret. Math. 312(12-13): 1968-1978 (2012) - 2011
- Miao Liang, Beiliang Du:
A new class of splitting 3-designs. Des. Codes Cryptogr. 60(3): 283-290 (2011) - Miao Liang, Jian Wang, Beiliang Du:
Support sizes of threefold quadruple systems. Discret. Math. 311(10-11): 804-816 (2011) - Jian Wang, Miao Liang, Beiliang Du:
The Spectrum of Tetrahedral Quadruple Systems. Graphs Comb. 27(4): 593-602 (2011) - 2010
- Zhaoping Meng, Lijun Ji, Beiliang Du:
The existence of augmented resolvable Steiner quadruple systems. Discret. Math. 310(13-14): 2007-2020 (2010) - 2009
- 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
- Jian Wang, Beiliang Du:
P5-factorization of complete bipartite graphs. Discret. Math. 308(9): 1665-1673 (2008) - 2006
- Beiliang Du:
Existence of resolvable optimal strong partially balanced designs. Discret. Appl. Math. 154(6): 930-941 (2006) - 2005
- Beiliang Du:
Splitting balanced incomplete block designs. Australas. J Comb. 31: 287-298 (2005) - Yan Zhang, Beiliang Du:
The existence of resolvable Mendelsohn designs RMD({3, s*}, v). Australas. J Comb. 32: 197-204 (2005) - Beiliang Du:
Resolvable optimal strong partially balanced designs with block size four. Discret. Math. 305(1-3): 136-153 (2005) - 2004
- Haitao Cao, Beiliang Du:
Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes. Discret. Math. 281(1-3): 83-95 (2004) - Beiliang Du:
The spectrum of optimal strong partially balanced designs with block size five. Discret. Math. 288(1-3): 19-28 (2004) - Beiliang Du:
Existence of optimal strong partially balanced designs with block size five. Discret. Math. 279(1-3): 173-190 (2004) - Jian Wang, Beiliang Du:
Kp, q-factorization of the complete bipartite graph Km, n. Discret. Math. 283(1-3): 283-287 (2004) - 2003
- R. Julian R. Abel, Beiliang Du:
The existence of three idempotent IMOLS. Discret. Math. 262(1-3): 1-16 (2003) - 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) - 2002
- Beiliang Du:
K1, pq-factorization of complete bipartite graphs. Australas. J Comb. 26: 85-92 (2002) - Beiliang Du, Jian Wang:
Kl, k-factorization of complete bipartite graphs. Discret. Math. 259(1-3): 301-306 (2002)
skipping 15 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-01 13:53 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint