{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:46:50Z","timestamp":1725857210648},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409696"},{"type":"electronic","value":"9783319409702"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40970-2_13","type":"book-chapter","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T07:14:55Z","timestamp":1465542895000},"page":"196-211","source":"Crossref","is-referenced-by-count":0,"title":["Computing Maximum Unavoidable Subgraphs Using SAT Solvers"],"prefix":"10.1007","author":[{"given":"C. K.","family":"Cuong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J. H.","family":"Heule","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for boolean satisfiability. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003, Acapulco, Mexico, 9\u201315 August 2003, pp. 271\u2013276. Morgan Kaufmann (2003)","DOI":"10.1109\/DAC.2003.1219135"},{"key":"13_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, Pasadena, California, USA, pp. 399\u2013404, 11\u201317 July 2009"},{"issue":"1","key":"13_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0095-8956(73)80005-X","volume":"14","author":"JA Bondy","year":"1973","unstructured":"Bondy, J.A., Erd\u0151s, P.: Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14(1), 46\u201354 (1973)","journal-title":"J. Combin. Theory Ser. B"},{"key":"13_CR4","first-page":"247","volume":"9","author":"SA Burr","year":"1976","unstructured":"Burr, S.A., Erd\u0151s, P.: Extremal Ramsey theory for graphs. Utilitas Math. 9, 247\u2013258 (1976)","journal-title":"Utilitas Math."},{"key":"13_CR5","unstructured":"Codish, M., Miller, A., Prosser, P., Stuckey, P.J.: Breaking symmetries in graph representation. In: Proceedings of IJCAI 2013, pp. 510\u2013516. IJCAI\/AAAI (2013)"},{"key":"13_CR6","first-page":"167","volume":"10","author":"L Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r, L., Gy\u00e1rf\u00e1s, A.: On Ramsey-type problems. Annales Universitatis Scientiarum Budapestinensis 10, 167\u2013170 (1967)","journal-title":"Annales Universitatis Scientiarum Budapestinensis"},{"key":"13_CR7","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. A Wiley-Interscience Publication. Wiley, New York (1990)"},{"key":"13_CR8","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0067364","volume-title":"Graph Theory and Applications","author":"F Harary","year":"1972","unstructured":"Harary, F.: Recent results on generalized ramsey theory for graphs. In: Alavi, Y., Lick, D.R., White, A.T. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303, pp. 125\u2013138. Springer, Heidelberg (1972)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the boolean pythagorean triples problem via cube-and-conquer. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 228\u2013245. Springer, Switzerland (2016)","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-319-09284-3_17","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"B Konev","year":"2014","unstructured":"Konev, B., Lisitsa, A.: A SAT attack on the Erd\u0151s discrepancy conjecture. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 219\u2013226. Springer, Heidelberg (2014)"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symbol. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symbol. Comput."},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190190304","volume":"19","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Radziszowski, S.P.: R(4, 5) = 25. J. Graph Theory 19(3), 309\u2013322 (1995)","journal-title":"J. Graph Theory"},{"key":"13_CR13","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Combin., #DS1 (2014)"},{"key":"13_CR14","first-page":"221","volume":"9","author":"SP Radziszowski","year":"1994","unstructured":"Radziszowski, S.P., Jin, X.: Paths, cycles and wheels in graphs without antitriangle. Australas. J. Combin. 9, 221\u2013232 (1994)","journal-title":"Australas. J. Combin."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 424\u2013429. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40970-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T10:09:09Z","timestamp":1568023749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40970-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409696","9783319409702"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40970-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}