{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:08Z","timestamp":1725483848929},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_32","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"477-491","source":"Crossref","is-referenced-by-count":10,"title":["Solving the Kirkman\u2019s Schoolgirl Problem in a Few Seconds"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Barnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Brisset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"32_CR1","unstructured":"Nicolas Barnier and Pascal Brisset. Facile: a functional constraint library. In Proceeding of CICLOPS2001, Paphos, 2001."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"M. B. Cohen, C. J. Colbourn, L. A. Ives, and A. C. H. Ling. Kirkman triple systems of order 21 with nontrivial automorphism group. Mathematics of Computation, 2001.","DOI":"10.1090\/S0025-5718-01-01372-2"},{"key":"32_CR3","unstructured":"CP\u201901: 7th International Conference on Principle and Practice of Constraint Programming, Paphos, Cyprus, 2001."},{"key":"32_CR4","unstructured":"CPAIOR\u2019 02: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, Le Croisic, France, 2002."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Torsten Fahle, Stefan Schamberger, and Meinolf Sellmann. Symmetry breaking. In CP\u201901 [3], pages 93\u2013107.","DOI":"10.1007\/3-540-45578-7_7"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Filippo Focacci and Michaela Milano. Global cut framework for removing symmetries. In CP\u201901 [3], pages 77\u201392.","DOI":"10.1007\/3-540-45578-7_6"},{"key":"32_CR7","unstructured":"I. Gent, T. Walsh, and B. Selman. CSPlib: a problem library for constraints, http:\/\/www-users.cs.york.ac.uk\/~tw\/csplib ."},{"key":"32_CR8","unstructured":"I. P. Gent and Barbara Smith. Symmetry breaking during search in contraint programming. In W. Horn, editor, EACI\u20192000, pages 599\u2013603, 2000."},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"Carmen Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3):191\u2013244, 1997. http:\/\/www.icparc.ic.ac.uk\/~cg6 .","journal-title":"Constraints"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. Karp. An n 5\/2 algorithm for maximum matching in bipartite graphs. SI AM Journal of Computing, 2(4):225\u2013231, 1973.","journal-title":"SI AM Journal of Computing"},{"key":"32_CR11","first-page":"255","volume":"5","author":"T. P. Kirkman","year":"1850","unstructured":"T. P. Kirkman. Note on an unanswered prize question. Cambridge and Dublin Mathematics Journal, 5:255\u2013262, 1850.","journal-title":"Cambridge and Dublin Mathematics Journal"},{"key":"32_CR12","unstructured":"JR Marshall Hall. Combinatorial Theory. Wiley Classics Library, second edition edition, 1983."},{"key":"32_CR13","first-page":"45","volume":"30","author":"B. D. McKay","year":"1981","unstructured":"Brendan D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45\u201387, 1981.","journal-title":"Congressus Numerantium"},{"key":"32_CR14","unstructured":"Steven Prestwich. Randomised backtracking for linear pseudo-boolean constraint problems. In CPAIOR\u201902 [4], pages 7\u201319."},{"key":"32_CR15","unstructured":"Jean-Charles R\u00e9gin. Generalized arc consistency for global cardinality constraint. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1996."},{"key":"32_CR16","unstructured":"Andre Sadler and Carmen Gervet. Global reasoning on sets. In Formul\u201901, Workshop Modelling and Problem Formulation, 2001."},{"key":"32_CR17","unstructured":"Meinolf Sellmann and Warwick Harvey. Heuristic constraint propagation. In CPAIOR\u201902 [4], pages 191\u2013204."},{"key":"32_CR18","unstructured":"Barbara Smith. Reducing symmetry in a combinatorial design problem. In CPAIOR\u201901, pages 351\u2013359, April 2001. http:\/\/www.icparc.ic.ac.uk\/cpAIOR01 ."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:40Z","timestamp":1556396740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}