{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:39:43Z","timestamp":1740101983559,"version":"3.37.3"},"reference-count":65,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175675","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF"],"prefix":"10.1109","author":[{"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[{"name":"Linköping University,Department of Computer and Information Science (IDA),Linköping,Sweden,SE-581 83"}]},{"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[{"name":"Institute of Logic and Computation, TU Wien,Wien,Austria,1040"}]},{"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,Cambridge,MA,USA,02139"}]},{"given":"Friedrich","family":"Slivovsky","sequence":"additional","affiliation":[{"name":"Institute of Logic and Computation, TU Wien,Wien,Austria,1040"}]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[{"name":"University of Leeds,School of Computing,Leeds,United Kingdom,LS2 9JT"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51825-7_19"},{"key":"ref12","article-title":"Quantified constraint satisfaction and bounded treewidth","author":"chen","year":"2004","journal-title":"ECAI'04"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4540"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3389131"},{"journal-title":"The graph parameter hierarchy","year":"2020","author":"sorge","key":"ref58"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.06.002"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/20M1353502"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA201000"},{"key":"ref10","article-title":"Tractable QBF by knowledge compilation","author":"capelli","year":"2019","journal-title":"STACS'19"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(06)80011-8"},{"journal-title":"Information System on Graph Classes and their Inclusions (ISGCI)","year":"2014","author":"de rider","key":"ref16"},{"journal-title":"Graph Theory","year":"2012","author":"diestel","key":"ref19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90037-4"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1613\/jair.591"},{"key":"ref46","article-title":"Fixed-parameter hierarchies inside PSPACE","author":"pan","year":"2006","journal-title":"LICS"},{"key":"ref45","article-title":"An effective QBF solver for planning problems","author":"otwell","year":"2004","journal-title":"AMCS'04"},{"key":"ref48","article-title":"A double exponential lower bound for the distinct vectors problem","author":"pilipczuk","year":"2020","journal-title":"Ser in Discrete Math and Theoretical Comput Sci"},{"journal-title":"Computational Complexity","year":"1994","author":"papadimitriou","key":"ref47"},{"key":"ref42","article-title":"Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth","author":"marx","year":"2016","journal-title":"ICALP'16"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.58"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","author":"ne\u0161et?il","year":"2012","journal-title":"Sparsity Graphs Structures and Algorithms"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_77"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2014.6987592"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA336"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"ref4","article-title":"Lower bounds for multiplayer non-cooperative games of incomplete information","author":"azhar","year":"2001","journal-title":"Journal of Computers and Mathematics with Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.04.014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190055"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1714450.1714452"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90044-3"},{"key":"ref35","article-title":"Non-CNF QBF solving with QCIR","author":"jordan","year":"2016","journal-title":"AAAI-16"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00026"},{"journal-title":"Propositional Logic Deduction and Algorithms","year":"1999","author":"kleine b\u00fcning","key":"ref36"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.172"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.003"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375564"},{"journal-title":"Finite Model Theory and Its Applications","year":"2005","author":"gr\u00e4del","key":"ref32"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"ref1","article-title":"The Achilles’ heel of QBF","author":"ans\u00f3tegui","year":"2005","journal-title":"AAAI'05"},{"key":"ref39","article-title":"Fine-grained meta-theorems for vertex integrity","author":"lampis","year":"2021","journal-title":"ISAAC'21"},{"key":"ref38","article-title":"Treewidth with a quantifier alternation revisited","author":"lampis","year":"2017","journal-title":"IPEC'17"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/259"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17953-3_15"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394756"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58475-7_15"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11750"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7"},{"key":"ref22","article-title":"Solving advanced reasoning tasks using quantified Boolean formulas","author":"egly","year":"2000","journal-title":"AAAI-00"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0127-x"},{"key":"ref65","article-title":"Algorithms for quantified Boolean formulas","author":"williams","year":"2002","journal-title":"SODA'02"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4225"},{"journal-title":"Parameterized Complexity Theory","year":"2006","author":"flum","key":"ref27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2017.12.006"},{"key":"ref60","article-title":"Characterizations of outerplanar graphs","author":"syslo","year":"1979","journal-title":"Discret Math"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/0220053"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175675.pdf?arnumber=10175675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:59:26Z","timestamp":1690912766000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175675","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}