{"id":"https://openalex.org/W2795215370","doi":"https://doi.org/10.4230/lipics.ipec.2017.26","title":"Treewidth with a Quantifier Alternation Revisited","display_name":"Treewidth with a Quantifier Alternation Revisited","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2795215370","doi":"https://doi.org/10.4230/lipics.ipec.2017.26","mag":"2795215370"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8551","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.26","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.26","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lampis, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5034146312","display_name":"Valia Mitsou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mitsou, Valia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0309,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80040295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.892799973487854,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.892799973487854,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8561999797821045,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6178628206253052},{"id":"https://openalex.org/keywords/alternation","display_name":"Alternation (linguistics)","score":0.6041051745414734},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5957720875740051},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.5422912240028381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.364940881729126},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3029780685901642},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2513839602470398},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.21135452389717102},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.11896634101867676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10414332151412964}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6178628206253052},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.6041051745414734},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5957720875740051},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.5422912240028381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.364940881729126},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3029780685901642},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2513839602470398},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.21135452389717102},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.11896634101867676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10414332151412964},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:8551","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.26","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:HAL:hal-03966735v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03966735","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Sep 2017, Vienna, Austria","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.4230/lipics.ipec.2017.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2017.26","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8551","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.26","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6870754648","display_name":"Games and graphs","funder_award_id":"ANR-14-CE25-0006","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8238292487","display_name":null,"funder_award_id":"14-CE25","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2059372025","https://openalex.org/W2984546510","https://openalex.org/W2914414140","https://openalex.org/W1995725694","https://openalex.org/W2798588639","https://openalex.org/W2116087731","https://openalex.org/W2491980552","https://openalex.org/W2014082347","https://openalex.org/W1900115821","https://openalex.org/W1991221373","https://openalex.org/W2563492869","https://openalex.org/W2074448200","https://openalex.org/W2078269136","https://openalex.org/W1611663043","https://openalex.org/W2108791618","https://openalex.org/W2598140278","https://openalex.org/W596633302","https://openalex.org/W3111164272","https://openalex.org/W2021568797","https://openalex.org/W2080114552"],"abstract_inverted_index":{"In":[0],"this":[1,42,283],"paper":[2],"we":[3,57,86,219],"take":[4],"a":[5,32,99,125,146,270],"closer":[6],"look":[7],"at":[8],"the":[9,15,20,23,27,39,50,59,64,80,88,94,109,116,119,139,163,176,199,234,238,256,264,285],"parameterized":[10,226,276],"complexity":[11,40,239,286],"of":[12,19,26,34,41,111,118,121,127,149,203,240,294],"\\exists\\forall":[13,72,142,169,204],"SAT,":[14,218],"prototypical":[16],"complete":[17],"problem":[18,43,144],"class":[21],"Sigma_2^p,":[22],"second":[24],"level":[25],"polynomial":[28],"hierarchy.":[29],"We":[30,262],"provide":[31],"number":[33,293],"tight":[35,221],"fine-grained":[36],"bounds":[37,62,225],"on":[38],"and":[44,211,216,223,233],"its":[45],"variants":[46],"with":[47,91,133],"respect":[48,92],"to":[49,70,93,124,246],"most":[51],"important":[52],"structural":[53],"graph":[54,188],"parameters.":[55],"Specifically,":[56],"show":[58],"following":[60],"lower":[61,105,224],"(assuming":[63],"ETH):":[65],"-":[66,137,168,197],"It":[67],"is":[68,153,162,171,251,258],"impossible":[69],"decide":[71],"SAT":[73,170,205,215],"in":[74,79,131,157,195,253,260],"time":[75,158],"less":[76,191],"than":[77],"double-exponential":[78,252,259,271],"input":[81,177],"formula's":[82,95],"treewidth.":[83],"More":[84],"strongly,":[85],"establish":[87],"same":[89],"bound":[90],"primal":[96,165,230],"vertex":[97,166,231,278],"cover,":[98,279],"much":[100],"more":[101,140],"restrictive":[102],"measure.":[103],"This":[104],"bound,":[106],"which":[107],"matches":[108],"performance":[110,120],"known":[112],"algorithms,":[113],"shows":[114],"that":[115,186,281],"degeneration":[117],"treewidth-based":[122],"algorithms":[123],"tower":[126],"exponentials":[128],"already":[129,172],"begins":[130],"problems":[132,194,243],"one":[134,250],"quantifier":[135,295],"alternation.":[136],"For":[138,198],"general":[141],"CSP":[143],"over":[145],"non-boolean":[147],"domain":[148],"size":[150],"B,":[151],"there":[152],"no":[154],"algorithm":[155,273],"running":[156],"2^{B^{o(vc)}},":[159],"where":[160],"vc":[161],"input's":[164],"cover.":[167],"NP-hard":[173],"even":[174],"when":[175],"formula":[178],"has":[179],"constant":[180],"modular":[181],"treewidth":[182,228],"(or":[183,229],"clique-width),":[184],"indicating":[185],"dense":[187],"parameters":[189],"are":[190],"useful":[192],"for":[193,274,282,291],"Sigma_2^p.":[196],"two":[200,242],"weighted":[201],"versions":[202],"recently":[206],"introduced":[207],"by":[208,227,268,277],"de":[209],"Haan":[210],"Szeider,":[212],"called":[213],"\\exists_k\\forall":[214],"\\exists\\forall_k":[217],"give":[220],"upper":[222],"cover)":[232],"weight":[235],"k.":[236,261],"Interestingly,":[237],"these":[241],"turns":[244],"out":[245],"be":[247],"quite":[248],"different:":[249],"treewidth,":[254],"while":[255],"other":[257],"complement":[263],"above":[265],"negative":[266],"results":[267],"showing":[269,280],"FPT":[272],"QBF":[275],"parameter":[284],"never":[287],"goes":[288],"beyond":[289],"double-exponential,":[290],"any":[292],"alternations.":[296]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2025-10-10T00:00:00"}