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
no matches
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 31 matches
- 2004
- R. Julian R. Abel, Iliya Bluskov, Malcolm Greig:
Balanced incomplete block designs with block size 9: part II. Discret. Math. 279(1-3): 5-32 (2004) - Ian Anderson, Donald A. Preece:
Narcissistic half-and-half power-sequence terraces for Zn with n=pqt. Discret. Math. 279(1-3): 33-60 (2004) - Frank E. Bennett, Yanxun Chang, Gennian Ge, Malcolm Greig:
Existence of (v, {5, wstar}, 1)-PBDs. Discret. Math. 279(1-3): 61-105 (2004) - Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin:
Preface. Discret. Math. 279(1-3): 1-2 (2004) - Marco Buratti, Alberto Del Fra:
Cyclic Hamiltonian cycle systems of the complete graph. Discret. Math. 279(1-3): 107-119 (2004) - Haitao Cao, Y. Tang:
On Kirkman packing designs KPD({3, 4}, v). Discret. Math. 279(1-3): 121-133 (2004) - Yanxun Chang, Jianxing Yin:
Further results on optimal optical orthogonal codes with weight 4. Discret. Math. 279(1-3): 135-151 (2004) - Kejun Chen, Zhenfu Cao, Dianhua Wu:
Existence of APAV(q, k) with q a prime power =5(mod 8) and k=1(mod 4). Discret. Math. 279(1-3): 153-161 (2004) - Wensong Chu, Charles J. Colbourn:
Optimal (n, 4, 2)-OOC of small orders. Discret. Math. 279(1-3): 163-172 (2004) - Beiliang Du:
Existence of optimal strong partially balanced designs with block size five. Discret. Math. 279(1-3): 173-190 (2004) - Kai-Tai Fang, Gennian Ge, Min-Qian Liu, Hong Qin:
Combinatorial constructions for optimal supersaturated designs. Discret. Math. 279(1-3): 191-202 (2004) - Norman J. Finizio:
One frame and several new infinite families of Z-cyclic whist designs. Discret. Math. 279(1-3): 203-213 (2004) - Norman J. Finizio, Brian J. Travers:
Z-cyclic generalized whist frames and Z-cyclic generalized whist tournaments. Discret. Math. 279(1-3): 215-223 (2004) - Gennian Ge, Alan C. H. Ling:
A survey on resolvable group divisible designs with block size four. Discret. Math. 279(1-3): 225-245 (2004) - Gennian Ge, Rolf S. Rees:
On group-divisible designs with block size four and group-type 6um1. Discret. Math. 279(1-3): 247-265 (2004) - Gennian Ge, Rolf S. Wei:
HGDDs with block size four. Discret. Math. 279(1-3): 267-276 (2004) - Henk D. L. Hollmann, Qing Xiang:
Kloosterman sum identities over F2m. Discret. Math. 279(1-3): 277-286 (2004) - Qingde Kang, Yanfang Zhang, Huijuan Zuo:
Packings and coverings of lambdaKv by k-circuits with one chord. Discret. Math. 279(1-3): 287-315 (2004) - Hadi Kharaghani, Behruz Tayfeh-Rezaie:
Some new orthogonal designs in orders 32 and 40. Discret. Math. 279(1-3): 317-324 (2004) - Selda Küçükçifçi, Charles C. Lindner:
Perfect hexagon triple systems. Discret. Math. 279(1-3): 325-335 (2004) - C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete graphs with a 3-factor leave. Discret. Math. 279(1-3): 337-344 (2004) - Jian-Guo Lei:
On large sets of Kirkman triple systems and 3-wise balanced design. Discret. Math. 279(1-3): 345-354 (2004) - Alan C. H. Ling, Pak Ching Li, G. H. John van Rees:
Splitting systems and separating systems. Discret. Math. 279(1-3): 355-368 (2004) - Meinard Müller, Masakazu Jimbo:
Consecutive positive detectable matrices and group testing for consecutive positives. Discret. Math. 279(1-3): 369-381 (2004) - Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson, Hajime Saido:
New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(1-3): 383-405 (2004) - Gaetano Quattrocchi, Eric Mendelsohn:
Minimum embedding of balanced P4-designs into 5-cycle systems. Discret. Math. 279(1-3): 407-421 (2004) - Jia-Yu Shao, Ling-Zhi Ren:
Some properties of matrices with signed null spaces. Discret. Math. 279(1-3): 423-435 (2004) - Hao Shen, Renwang Su, Dameng Deng:
Existence of incomplete resolvable minimum coverings of pairs by triples. Discret. Math. 279(1-3): 437-462 (2004) - Douglas R. Stinson, Ruizhong Wei:
Generalized cover-free families. Discret. Math. 279(1-3): 463-477 (2004) - Guest Editors. Discret. Math. 279(1-3): 3- (2004)
skipping 1 more match
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-09-24 12:57 CEST 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