{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:15Z","timestamp":1725603435020},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_41","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"538-545","source":"Crossref","is-referenced-by-count":1,"title":["Searching for Doubly Self-orthogonal Latin Squares"],"prefix":"10.1007","author":[{"given":"Runming","family":"Lu","sequence":"first","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","first-page":"13","volume":"20","author":"B. Du","year":"1997","unstructured":"Du, B., Zhu, L.: Existence of doubly self-orthogonal Latin squares. Bulletin of the Institute of Combinatorics and its Applications (Bulletin of the ICA)\u00a020, 13\u201318 (1997)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications (Bulletin of the ICA)"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45578-7_8","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"O. Dubois","year":"2001","unstructured":"Dubois, O., Dequen, G.: The non-existence of (3, 1, 2)-conjugate orthogonal idempotent Latin square of order 10. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 108\u2013120. Springer, Heidelberg (2001)"},{"issue":"2","key":"41_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90250-9","volume":"46","author":"K. Heinrich","year":"1983","unstructured":"Heinrich, K., Hilton, A.J.W.: Doubly diagonal orthogonal latin squares. Discrete Mathematics\u00a046(2), 173\u2013182 (1983)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"41_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/74926.74967","volume":"17","author":"K. Kim","year":"1989","unstructured":"Kim, K., Prasanna-Kumar, V.K.: Perfect Latin squares and parallel array access. SIGARCH Comput. Archit. News\u00a017(3), 372\u2013379 (1989)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"41_CR5","unstructured":"Knuth, D.E.: Dancing links. Arxiv preprint cs\/0011047 (2000)"},{"key":"41_CR6","series-title":"London Mathematical Society Lecture Note Series","first-page":"57","volume-title":"Surveys in Combinatorics","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2005","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: Constructing combinatorial objects via cliques. In: Webb, B.S. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0327, pp. 57\u201382. Cambridge University Press, Cambridge (2005)"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1023\/B:HEUR.0000034713.28244.e1","volume":"10","author":"M. Vasquez","year":"2004","unstructured":"Vasquez, M.: New results on the queens_n\n                  \n                    \n                      \n                    \n                    $^{\\mbox{2}}$\n                   graph coloring problem. J. of Heuristics\u00a010(4), 407\u2013413 (2004)","journal-title":"J. of Heuristics"},{"key":"41_CR8","volume-title":"Handbook of Satisfiability","author":"H. Zhang","year":"2009","unstructured":"Zhang, H.: Combinatorial designs by SAT solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, vol.\u00a02. IOS Press, Amsterdam (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T16:15:45Z","timestamp":1554135345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}