{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:19:36Z","timestamp":1742923176905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637346"},{"type":"electronic","value":"9783031637353"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63735-3_6","type":"book-chapter","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T21:02:07Z","timestamp":1721682127000},"page":"94-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending the\u00a0Tractability of\u00a0the\u00a0Clique Problem via\u00a0Graph Classes Generalizing Treewidth"],"prefix":"10.1007","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,23]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 13\u201317 May 1990, Baltimore, Maryland, USA, pp. 293\u2013299 (1990)","DOI":"10.1145\/100216.100254"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01934985","volume":"25","author":"S Arnborg","year":"1985","unstructured":"Arnborg, S.: Efficient algorithms for combinatorial problems with bounded decomposability - a survey. BIT 25(1), 1\u201323 (1985)","journal-title":"BIT"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskuroswk, A.: Complexity of finding embeddings in a k-tree. SIAM J. Discret. Math. 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"6_CR4","first-page":"12","volume":"25","author":"L Hans","year":"1996","unstructured":"Hans, L.: Bodlaender: a linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 12\u201375 (1996)","journal-title":"SIAM J. Comput."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Courceller, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graph. Inf. Comput. 85(1), 1305\u20131317 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"6_CR7","unstructured":"J\u00e9gou, P.: Decomposition of domains based on the micro-structure of finite constraint satisfaction problems. In: AAAI Proceedings, Washington DC, USA, pp. 731\u2013736 (1993)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. AMS (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-030-30048-7_21","volume-title":"Principles and Practice of Constraint Programming","author":"D Mitchell","year":"2019","unstructured":"Mitchell, D.: Guarded constraint models define treewidth preserving reductions. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 350\u2013365. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_21"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II: algorithmic aspects of treewidth. Algorithms 7, 309\u2013322 (1986)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63735-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T16:06:47Z","timestamp":1732464407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63735-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637346","9783031637353"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63735-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ISAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Artificial Intelligence and Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fort Lauderdale, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isaim2024.cs.ou.edu\/iwcia.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}