{"id":"https://openalex.org/W1968041356","doi":"https://doi.org/10.1137/140964801","title":"Large Induced Subgraphs via Triangulations and CMSO","display_name":"Large Induced Subgraphs via Triangulations and CMSO","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1968041356","doi":"https://doi.org/10.1137/140964801","mag":"1968041356"},"language":"en","primary_location":{"id":"doi:10.1137/140964801","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140964801","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["University of Bergen"],"affiliations":[{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081733098","display_name":"Ioan Todinca","orcid":"https://orcid.org/0000-0002-3466-859X"},"institutions":[{"id":"https://openalex.org/I4387153997","display_name":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans","ror":"https://ror.org/01nr3td38","country_code":null,"type":"facility","lineage":["https://openalex.org/I12449238","https://openalex.org/I4210143826","https://openalex.org/I4387153997"]},{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ioan Todinca","raw_affiliation_strings":["Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique Fondamentale d'Orl\u00e9ans","institution_ids":["https://openalex.org/I4210115196","https://openalex.org/I4387153997"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109879985","display_name":"Yngve Villanger","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Yngve Villanger","raw_affiliation_strings":["University of Bergen"],"affiliations":[{"raw_affiliation_string":"University of Bergen","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":17.5138,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.9943223,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"44","issue":"1","first_page":"54","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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":"Advanced Graph Theory Research","score":0.9998999834060669,"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":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.8275578022003174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8151568174362183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7311491370201111},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5863283276557922},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5119527578353882},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49993324279785156},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4825155436992645},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46017566323280334},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4582393169403076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44822341203689575},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4149724841117859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22469395399093628},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1511087715625763},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11090633273124695}],"concepts":[{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.8275578022003174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8151568174362183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7311491370201111},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5863283276557922},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5119527578353882},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49993324279785156},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4825155436992645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46017566323280334},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4582393169403076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44822341203689575},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4149724841117859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22469395399093628},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1511087715625763},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11090633273124695}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140964801","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140964801","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01223941v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01223941","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":"SIAM Journal on Computing, 2015, 44 (1), pp.54-87. ⟨10.1137/140964801⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W8067098","https://openalex.org/W182050876","https://openalex.org/W1507920302","https://openalex.org/W1563108031","https://openalex.org/W1569612812","https://openalex.org/W1576190294","https://openalex.org/W1579049696","https://openalex.org/W1623604111","https://openalex.org/W1964653177","https://openalex.org/W1968240611","https://openalex.org/W1974366154","https://openalex.org/W1977889556","https://openalex.org/W1979428714","https://openalex.org/W1981917097","https://openalex.org/W1983652976","https://openalex.org/W1983860528","https://openalex.org/W1985733932","https://openalex.org/W1991178581","https://openalex.org/W1993920925","https://openalex.org/W1996472240","https://openalex.org/W1998736151","https://openalex.org/W2002722727","https://openalex.org/W2010030994","https://openalex.org/W2012329067","https://openalex.org/W2013421520","https://openalex.org/W2013568176","https://openalex.org/W2013967419","https://openalex.org/W2015963099","https://openalex.org/W2020270928","https://openalex.org/W2025756084","https://openalex.org/W2028357390","https://openalex.org/W2031076941","https://openalex.org/W2032762881","https://openalex.org/W2038049091","https://openalex.org/W2038177235","https://openalex.org/W2044104853","https://openalex.org/W2047470084","https://openalex.org/W2047899424","https://openalex.org/W2057789585","https://openalex.org/W2057826895","https://openalex.org/W2060685279","https://openalex.org/W2061237693","https://openalex.org/W2061782500","https://openalex.org/W2062221600","https://openalex.org/W2062897452","https://openalex.org/W2064796716","https://openalex.org/W2073025989","https://openalex.org/W2085348754","https://openalex.org/W2087083200","https://openalex.org/W2089718638","https://openalex.org/W2091208300","https://openalex.org/W2096113666","https://openalex.org/W2097844290","https://openalex.org/W2104062785","https://openalex.org/W2115994533","https://openalex.org/W2124442576","https://openalex.org/W2125720043","https://openalex.org/W2143474538","https://openalex.org/W2165605193","https://openalex.org/W2187700168","https://openalex.org/W2295651994","https://openalex.org/W2402064113","https://openalex.org/W2570366614","https://openalex.org/W2962728077","https://openalex.org/W4210377846","https://openalex.org/W4241342922"],"related_works":["https://openalex.org/W2075531723","https://openalex.org/W2113684989","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W2800485060","https://openalex.org/W1787126581","https://openalex.org/W4302768721","https://openalex.org/W1584965761","https://openalex.org/W2951007762","https://openalex.org/W2583459474"],"abstract_inverted_index":{"We":[0,74,151],"obtain":[1],"an":[2,25,76,173],"algorithmic":[3,137],"metatheorem":[4],"for":[5,148,182],"the":[6,32,40,54,67,97,118,122,170],"following":[7],"optimization":[8,80],"problem.":[9],"Let":[10],"$\\varphi$":[11,114],"be":[12,24,162],"a":[13,28,44,109,134],"counting":[14],"monadic":[15],"second":[16],"order":[17],"logic":[18],"(CMSO)":[19],"formula":[20],"and":[21,66,106,113,140],"$t\\geq":[22],"0$":[23],"integer.":[26],"For":[27],"given":[29],"graph":[30,85,130,149],"$G=(V,E)$,":[31],"task":[33],"is":[34,43,60,96,108],"to":[35,39,187],"maximize":[36],"$|X|$":[37],"subject":[38],"following:":[41],"there":[42,132],"set":[45,98],"$":[46],"F\\subseteq":[47],"V$":[48],"such":[49],"that":[50,154],"$X\\subseteq":[51],"F":[52],"$,":[53],"subgraph":[55],"$G[F]$":[56],"induced":[57,190],"by":[58],"$F$":[59],"of":[61,99,111,124,136,159,172,177],"treewidth":[62],"at":[63],"most":[64],"$t$,":[65],"structure":[68],"$(G[F],X)$":[69],"models":[70],"$\\varphi$,":[71],"i.e.,":[72],"$(G[F],X)\\models\\varphi$.":[73],"give":[75],"algorithm":[77,176],"solving":[78],"this":[79],"problem":[81],"on":[82,121,145],"any":[83],"$n$-vertex":[84],"$G$":[86,105,160],"in":[87,104,128,164],"time":[88,165,179],"${\\cal":[89,166,180],"O}(|\\Pi_G|":[90],"\\cdot":[91],"n^{t+4}\\cdot":[92],"f(t,\\varphi))$,":[93],"where":[94],"$\\Pi_G$":[95],"all":[100,155],"potential":[101,125,156],"maximal":[102,126,157],"cliques":[103,127,158],"$f$":[107],"function":[110],"$t$":[112],"only.":[115],"Pipelined":[116],"with":[117,192],"known":[119,143],"bounds":[120],"number":[123],"different":[129,193],"classes,":[131],"are":[133],"plethora":[135],"consequences":[138],"extending":[139],"subsuming":[141],"many":[142,183],"results":[144],"polynomial-time":[146],"algorithms":[147],"classes.":[150],"also":[152],"show":[153],"can":[161],"enumerated":[163],"O}(1.7347^n)$.":[167],"This":[168],"implies":[169],"existence":[171],"exact":[174],"exponential":[175],"running":[178],"O}(1.7347^n)$":[181],"NP-hard":[184],"problems":[185],"related":[186],"finding":[188],"maximum":[189],"subgraphs":[191],"properties.":[194]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":34},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}