{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:20:33Z","timestamp":1775053233213,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3425,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0012-365x(03)00266-8","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T04:08:46Z","timestamp":1065672526000},"page":"163-172","source":"Crossref","is-referenced-by-count":31,"title":["Optimal (n,4,2)-OOC of small orders"],"prefix":"10.1016","volume":"279","author":[{"given":"Wensong","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0012-365X(03)00266-8_BIB1","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","article-title":"Reactive local search for the maximum clique problem","volume":"29","author":"Battiti","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0012-365X(03)00266-8_BIB2","unstructured":"Wensong Chu, Optical orthogonal codes and cyclic t-designs, Ph.D. Thesis, University of Southern California, 2002."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB3","doi-asserted-by":"crossref","unstructured":"Wensong Chu, S.W. Golomb, A new recursive construction for optical orthogonal codes, IEEE Trans. Inform. Theory, November 2003, to be published.","DOI":"10.1109\/TIT.2003.818387"},{"key":"10.1016\/S0012-365X(03)00266-8_BIB4","unstructured":"Wensong Chu, S.W. Golomb, From optical orthogonal codes to cyclic Steiner quadruple systems, 2001, preprint."},{"issue":"3","key":"10.1016\/S0012-365X(03)00266-8_BIB5","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/18.30982","article-title":"Optical orthogonal codes","volume":"35","author":"Chung","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00266-8_BIB6","unstructured":"C. Colbourn, Web page, http:\/\/www.public.asu.edu\/~ccolbou\/."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.4153\/CJM-1960-013-3","article-title":"On quadruple systems","volume":"12","author":"Hanani","year":"1960","journal-title":"Canad. J. Math."},{"issue":"6","key":"10.1016\/S0012-365X(03)00266-8_BIB8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/jcd.10025","article-title":"An improved product construction of rotational Steiner quadruple systems","volume":"10","author":"Ji","year":"2002","journal-title":"J. Combin. Des."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB9","first-page":"424","article-title":"A new algorithm for the maximum-weight clique problem","volume":"8","author":"\u00d6sterg\u00e5rd","year":"2001","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","article-title":"A fast algorithm for the maximum clique problem","volume":"120","author":"\u00d6sterg\u00e5rd","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB11","first-page":"177","article-title":"Rotational Steiner quadruple systems","volume":"4","author":"Phelps","year":"1977","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(03)00266-8_BIB12","doi-asserted-by":"crossref","unstructured":"Lie Zhu, Private e-mail communication, 2001.","DOI":"10.1081\/AGB-100106807"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002668?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002668?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T22:43:40Z","timestamp":1585176220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0012365X03002668"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00266-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}