{"id":"https://openalex.org/W1519337743","doi":"https://doi.org/10.1007/978-3-642-15775-2_47","title":"Algorithmic Meta-theorems for Restrictions of Treewidth","display_name":"Algorithmic Meta-theorems for Restrictions of Treewidth","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1519337743","doi":"https://doi.org/10.1007/978-3-642-15775-2_47","mag":"1519337743"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15775-2_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I174216632","display_name":"City University of New York","ror":"https://ror.org/00453a208","country_code":"US","type":"education","lineage":["https://openalex.org/I174216632"]},{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["Computer Science Department, Graduate Center, City University of New York,"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Graduate Center, City University of New York,","institution_ids":["https://openalex.org/I174216632","https://openalex.org/I121847817"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":["https://openalex.org/I174216632","https://openalex.org/I121847817"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392,"provenance":"doaj"},"apc_paid":null,"fwci":2.648,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.846667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":88},"biblio":{"volume":null,"issue":null,"first_page":"549","last_page":"560"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9999,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Graph Theory and Algorithms","score":0.9999,"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"}},{"id":"https://openalex.org/T11567","display_name":"Automata Theory and Formal Languages","score":0.9944,"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"}},{"id":"https://openalex.org/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9896,"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/vertex-cover","display_name":"Vertex cover","score":0.60370576},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized Complexity","score":0.544186},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.525227},{"id":"https://openalex.org/keywords/constraint-satisfaction-problems","display_name":"Constraint Satisfaction Problems","score":0.524564},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph Algorithms","score":0.510113},{"id":"https://openalex.org/keywords/fixed-parameter-algorithms","display_name":"Fixed-Parameter Algorithms","score":0.508123},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.4593904}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.94696975},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7447122},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.62710726},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.60370576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.56758463},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.529807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.50332135},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47610223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.475211},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.4593904},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.44065097},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.43840408},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4190361},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36071905},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26441976},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.114257395},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15775-2_47","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"book series"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1485295947","https://openalex.org/W1486674860","https://openalex.org/W1559081432","https://openalex.org/W1581222813","https://openalex.org/W1759963290","https://openalex.org/W1799657476","https://openalex.org/W1971818177","https://openalex.org/W1993920925","https://openalex.org/W2011105641","https://openalex.org/W2028357390","https://openalex.org/W2043791970","https://openalex.org/W2053991811","https://openalex.org/W2064796716","https://openalex.org/W2066585576","https://openalex.org/W2100346402","https://openalex.org/W2126987206","https://openalex.org/W2952680644"],"related_works":["https://openalex.org/W2962819865","https://openalex.org/W2889180046","https://openalex.org/W2162616398","https://openalex.org/W2029854525","https://openalex.org/W2027513055","https://openalex.org/W2012687409","https://openalex.org/W1976463682","https://openalex.org/W1585579706","https://openalex.org/W143512583","https://openalex.org/W101378340"],"abstract_inverted_index":{"Possibly":[0],"the":[1,27,32,35,84],"most":[2],"famous":[3],"algorithmic":[4,104],"meta-theorem":[5],"is":[6,37,118,139],"Courcelle\u2019s":[7],"theorem,":[8],"which":[9,163],"states":[10],"that":[11,53,137,165],"all":[12],"MSO-expressible":[13],"graph":[14],"properties":[15],"are":[16],"decidable":[17],"in":[18,38,125],"linear":[19],"time":[20],"for":[21,106],"graphs":[22,90,96,146],"of":[23,42,44,83,86,91,97,111,127,147],"bounded":[24,87,92,98,148],"treewidth.":[25],"Unfortunately,":[26],"running":[28],"time\u2019s":[29],"dependence":[30,73,135],"on":[31,67,79,145],"formula":[33],"describing":[34],"problem":[36,183],"general":[39],"a":[40,131,152],"tower":[41],"exponentials":[43],"unbounded":[45],"height,":[46],"and":[47,95,136],"there":[48],"exist":[49],"lower":[50,160],"bounds":[51,168],"proving":[52],"this":[54,71],"cannot":[55,169],"be":[56,75,170],"improved":[57,76,171],"even":[58],"if":[59],"we":[60,115],"restrict":[61],"ourselves":[62],"to":[63,120,141],"deciding":[64],"FO":[65,123],"logic":[66,144],"trees.We":[68],"investigate":[69],"whether":[70],"parameter":[72,134,155],"can":[74],"by":[77,185],"focusing":[78],"two":[80],"proper":[81],"subclasses":[82],"class":[85],"treewidth":[88],"graphs:":[89],"vertex":[93,149],"cover":[94,150],"max-leaf":[99],"number.":[100],"We":[101,157],"prove":[102,159],"stronger":[103],"meta-theorems":[105],"these":[107,128],"more":[108],"restricted":[109],"classes":[110,129],"graphs.":[112],"More":[113],"specifically,":[114],"show":[116,164],"it":[117,138],"possible":[119,140],"decide":[121,142],"any":[122],"property":[124],"both":[126],"with":[130,151],"singly":[132],"exponential":[133,154],"MSO":[143],"doubly":[153],"dependence.":[156],"also":[158],"bound":[161],"results":[162],"our":[166],"upper":[167],"significantly,":[172],"under":[173],"widely":[174],"believed":[175],"complexity":[176],"assumptions.":[177],"Our":[178],"work":[179],"addresses":[180],"an":[181],"open":[182],"posed":[184],"Michael":[186],"Fellows.":[187]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1519337743","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2024-10-08T18:03:37.176396","created_date":"2016-06-24"}
