{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:03:34Z","timestamp":1755799414133,"version":"3.44.0"},"reference-count":39,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE40-0025-01"],"award-info":[{"award-number":["ANR-18-CE40-0025-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["714704"],"award-info":[{"award-number":["714704"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","award":["ASSK: ANR-18-CE40-0025-01"],"award-info":[{"award-number":["ASSK: ANR-18-CE40-0025-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation, Korea","doi-asserted-by":"publisher","award":["RS-2025-00563533"],"award-info":[{"award-number":["RS-2025-00563533"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2025,8,31]]},"DOI":"10.1137\/23m1553698","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T20:01:51Z","timestamp":1755633711000},"page":"1065-1137","source":"Crossref","is-referenced-by-count":0,"title":["Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints"],"prefix":"10.1137","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6824-0516","authenticated-orcid":true,"given":"Eun Jung","family":"Kim","sequence":"first","affiliation":[{"name":"School of Computing, KAIST and Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea \/ CNRS, France."}]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany."}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5680-7397","authenticated-orcid":true,"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0933-4504","authenticated-orcid":true,"given":"Magnus","family":"Wahlstr\u00f6m","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, TW20 0EX, UK."}]}],"member":"351","published-online":{"date-parts":[[2025,8,13]]},"reference":[{"key":"ref1","first-page":"1","volume-title":"The Constraint Satisfaction Problem, Dagstuhl Follow-Ups 7","author":"Barto L.","year":"2017"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.ipl.2005.06.003"},{"key":"ref4","first-page":"18","volume-title":"ESA, LIPIcs 57","author":"Bonnet \u00c9.","year":"2016"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/FOCS.2017.37"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1137\/120882160"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/1411509.1411511"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1137\/15M1032077"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/s00453-016-0139-6"},{"key":"ref11","first-page":"115","volume":"38","author":"Couceiro M.","year":"2022","journal-title":"J. Multiple Valued Log. Soft Comput."},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1137\/1.9780898718546"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.jcss.2008.02.005"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/978-3-540-92800-3_2"},{"year":"2015","author":"Cygan M.","journal-title":"Springer","key":"ref15"},{"key":"ref16","first-page":"11","volume-title":"18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, LIPIcs 285","author":"Dabrowski K. K.","year":"2023"},{"key":"ref17","series-title":"Grad. Texts in Math. 173","volume-title":"Graph Theory","author":"Diestel R.","year":"2012","edition":"4"},{"key":"ref18","first-page":"64","volume-title":"13th Innovations in Theoretical Computer Science Conference, ITCS 2022, Berkeley, CA, 2022, LIPIcs 215","author":"Eldan R.","year":"2022"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/167088.167245"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-3-031-15914-5_19"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/j.disopt.2010.05.003"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1137\/S0097539799349948"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/3641105"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/3706103"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/3519935.3520018"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1137\/22M153118X"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1137\/16M1091836"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/2858787"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1007\/978-3-642-14165-2_55"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/3390887"},{"key":"ref33","series-title":"Dagstuhl Follow-Ups 7","volume-title":"The Constraint Satisfaction Problem: Complexity and Approximability","author":"Krokhin A. A.","year":"2017"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/3212622"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/s00037-005-0195-9"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/j.ipl.2009.07.016"},{"key":"ref38","first-page":"93","volume-title":"32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, 2024, LIPIcs 308","author":"Osipov G.","year":"2024"},{"key":"ref39","first-page":"86","volume-title":"31st Annual European Symposium on Algorithms, ESA 2023, Amsterdam, The Netherlands, 2023, LIPIcs 274","author":"Osipov G.","year":"2023"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/j.jcss.2009.04.002"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1016\/j.orl.2003.10.009"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1145\/800133.804350"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1145\/2974019"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1145\/3402029"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T20:01:54Z","timestamp":1755633714000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1553698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8,31]]}},"alternative-id":["10.1137\/23M1553698"],"URL":"https:\/\/doi.org\/10.1137\/23m1553698","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"type":"print","value":"0097-5397"},{"type":"electronic","value":"1095-7111"}],"subject":[],"published":{"date-parts":[[2025,8,13]]}}}