{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:54:34Z","timestamp":1648990474645},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,2]],"date-time":"2012-11-02T00:00:00Z","timestamp":1351814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1256-x","type":"journal-article","created":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T06:46:21Z","timestamp":1351752381000},"page":"141-157","source":"Crossref","is-referenced-by-count":2,"title":["On The Spectrum of Minimal Defining Sets of Full Designs"],"prefix":"10.1007","volume":"30","author":[{"given":"Fatih","family":"Demirkale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emine \u015eule","family":"Yaz\u0131c\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,2]]},"reference":[{"key":"1256_CR1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0097-3165(84)90084-0","volume":"36","author":"R.T. Curtis","year":"1984","unstructured":"Curtis R.T.: Eight octads suffice. J. Combin. Theory (Ser. A) 36, 116\u2013123 (1984)","journal-title":"J. Combin. Theory (Ser. A)"},{"key":"1256_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0004972700017883","volume":"41","author":"K. Gray","year":"1990","unstructured":"Gray K.: On the minimum number of blocks defining a design. Bull. Aust. Math. Soc. 41, 97\u2013112 (1990)","journal-title":"Bull. Aust. Math. Soc."},{"key":"1256_CR3","first-page":"147","volume":"57","author":"J. Seberry","year":"2000","unstructured":"Seberry J., Street A.P.: Strongbox secured secret sharing schemes. Util. Math. 57, 147\u2013163 (2000)","journal-title":"Util. Math."},{"key":"1256_CR4","doi-asserted-by":"crossref","unstructured":"Donovan, D.M., Mahmoodian, E.S., Ramsay, C., Street, A.P.: Defining sets in combinatorics: a survey. In: Wensley, C.D. (ed.) Surveys in Combinatorics, pp. 115\u2013174. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9781107359970.006"},{"key":"1256_CR5","first-page":"97","volume":"60","author":"K. Gray","year":"2007","unstructured":"Gray K., Street A.P.: On defining sets of full designs and of designs related to them. J. Combin. Math. Combin. Comput. 60, 97\u2013104 (2007)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1256_CR6","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1007\/s00373-010-0882-4","volume":"25","author":"D. Donovan","year":"2009","unstructured":"Donovan D., Lefevre J., Waterhouse M., Yaz\u0131c\u0131 E.\u015e.: On defining sets of full designs with block size three. Graphs Combin. 25, 825\u2013839 (2009)","journal-title":"Graphs Combin."},{"key":"1256_CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00026-012-0143-8","volume":"16","author":"D. Donovan","year":"2012","unstructured":"Donovan D., Lefevre J., Waterhouse M., Yaz\u0131c\u0131 E.\u015e.: Defining sets of full designs with block size three II. Ann. Combin. 16, 507\u2013515 (2012)","journal-title":"Ann. Combin."},{"key":"1256_CR8","first-page":"67","volume":"75","author":"G. Havas","year":"2008","unstructured":"Havas G., Lawrence J.L., Ramsay C., Street A.P., Yaz\u0131c\u0131 E.\u015e.: Defining set spectra for designs can have arbitrarily large gaps. Util. Math. 75, 67\u201381 (2008)","journal-title":"Util. Math."},{"key":"1256_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s00373-010-0892-2","volume":"26","author":"E. Koloto\u011flu","year":"2010","unstructured":"Koloto\u011flu E., Yaz\u0131c\u0131 E.\u015e.: On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of t-designs. Graphs Combin. 26, 259\u2013281 (2010)","journal-title":"Graphs Combin."},{"key":"1256_CR10","first-page":"5","volume":"23","author":"S. Akbari","year":"2001","unstructured":"Akbari S., Maimani H.R., Maysoori Ch.: Minimal defining sets for full 2\u2212(v, 3, v\u22122) designs. Aust. J. Combin. 23, 5\u20138 (2001)","journal-title":"Aust. J. Combin."},{"key":"1256_CR11","first-page":"91","volume":"76","author":"K. Gray","year":"2008","unstructured":"Gray K., Street A.P.: Constructing defining sets of full designs. Util. Math. 76, 91\u201399 (2008)","journal-title":"Util. Math."},{"key":"1256_CR12","first-page":"209","volume":"17","author":"A. Khodkar","year":"1995","unstructured":"Khodkar A.: Smallest defining sets for the 36 non-isomorphic twofold triple systems of order nine. J. Combin. Math. Combin. Comput. 17, 209\u2013215 (1995)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1256_CR13","unstructured":"ILOG CPLEX Callable Library, IBM Corporation, 1987\u20132009"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1256-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1256-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1256-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T04:28:34Z","timestamp":1562300914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1256-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1256"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1256-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,2]]}}}