{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:48:25Z","timestamp":1765889305127,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722525"},{"type":"electronic","value":"9789819722532"}],"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-981-97-2253-2_35","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T10:02:11Z","timestamp":1713952931000},"page":"444-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Contraction Tree SAT Encoding for\u00a0Computing Twin-Width"],"prefix":"10.1007","author":[{"given":"Yinon","family":"Horev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiraz","family":"Shay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarel","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davis","family":"Issac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lior","family":"Kamma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aikaterini","family":"Niklanovits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Simonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","unstructured":"Balab\u00e1n, J., Hlin\u011bn\u00fd, P.: Twin-width is linear in the Poset width. In: Golovach, P.A., Zehavi, M. (eds.) 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 214, pp. 6:1\u20136:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2021.6","DOI":"10.4230\/LIPIcs.IPEC.2021.6"},{"key":"35_CR2","doi-asserted-by":"publisher","unstructured":"Berg\u00e9, P., Bonnet, \u00c9., D\u00e9pr\u00e9s, H.: Deciding twin-width at most 4 is np-complete. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 4\u20138 July 2022, Paris. LIPIcs, vol. 229, pp. 18:1\u201318:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.18","DOI":"10.4230\/LIPIcs.ICALP.2022.18"},{"key":"35_CR3","doi-asserted-by":"publisher","unstructured":"Bonnet, E., D\u00e9pr\u00e9s, H.: Twin-width can be exponential in treewidth. J. Comb. Theory Ser. B 161(C), 1\u201314 (2023). https:\/\/doi.org\/10.1016\/j.jctb.2023.01.003","DOI":"10.1016\/j.jctb.2023.01.003"},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Geniet, C., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width II: small classes. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10\u201313 January 2021, pp. 1977\u20131996. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.118","DOI":"10.1137\/1.9781611976465.118"},{"key":"35_CR5","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Geniet, C., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width III: max independent set, min dominating set, and coloring. In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, 12\u201316 July 2021, Glasgow (Virtual Conference). LIPIcs, vol. 198, pp. 35:1\u201335:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.35","DOI":"10.4230\/LIPIcs.ICALP.2021.35"},{"key":"35_CR6","doi-asserted-by":"publisher","unstructured":"Bonnet, E., Kim, E.J., Reinald, A., Thomass\u00e9, S., Watrigant, R.: Twin-width and polynomial kernels. In: Golovach, P.A., Zehavi, M. (eds.) 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 214, pp. 10:1\u201310:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2021.10","DOI":"10.4230\/LIPIcs.IPEC.2021.10"},{"key":"35_CR7","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Kim, E.J., Thomass\u00e9, S., Watrigant, R.: Twin-width I: tractable FO model checking. J. ACM 69(1), 3:1\u20133:46 (2022). https:\/\/doi.org\/10.1145\/3486655","DOI":"10.1145\/3486655"},{"key":"35_CR8","doi-asserted-by":"publisher","unstructured":"Ganian, R., Pokr\u00fdvka, F., Schidler, A., Simonov, K., Szeider, S.: Weighted model counting with twin-width. In: Meel, K.S., Strichman, O. (eds.) 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, 2\u20135 August 2022, Haifa. LIPIcs, vol. 236, pp. 15:1\u201315:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2022.15","DOI":"10.4230\/LIPIcs.SAT.2022.15"},{"key":"35_CR9","doi-asserted-by":"publisher","unstructured":"Guillemot, S., Marx, D.: Finding small patterns in permutations in linear time. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, 5\u20137 January 2014, pp. 82\u2013101. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.7","DOI":"10.1137\/1.9781611973402.7"},{"key":"35_CR10","doi-asserted-by":"publisher","unstructured":"Jacob, H., Pilipczuk, M.: Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. In: Bekos, M.A., Kaufmann, M. (eds.) Graph-Theoretic Concepts in Computer Science. WG 2022. LNCS, vol. 13453, pp. 287\u2013299. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_21","DOI":"10.1007\/978-3-031-15914-5_21"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l, D., Lamaison, A.: Planar graph with twin-width seven. arXiv preprint arXiv:2209.11537 (2022)","DOI":"10.1016\/j.ejc.2023.103749"},{"key":"35_CR12","doi-asserted-by":"publisher","unstructured":"Kr\u00e1l\u2019, D., Lamaison, A.: Planar graph with twin-width seven. Eur. J. Combinator. 103749 (2023). https:\/\/doi.org\/10.1016\/j.ejc.2023.103749","DOI":"10.1016\/j.ejc.2023.103749"},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Marques-Silva, J., Lynce, I.: Towards robust CNF encodings of cardinality constraints. In: Bessiere, C. (ed.) Principles and Practice of Constraint Programming. CP 2007. LNCS, vol. 4741, pp. 483\u2013497. Springer, Cham (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_35","DOI":"10.1007\/978-3-540-74970-7_35"},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Schidler, A., Szeider, S.: A SAT approach to twin-width. In: Phillips, C.A., Speckmann, B. (eds.) Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, 9\u201310 January 2022, pp. 67\u201377. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977042.6","DOI":"10.1137\/1.9781611977042.6"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2253-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T23:15:36Z","timestamp":1714000536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2253-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722525","9789819722532"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2253-2_35","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":"25 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}