{"id":"https://openalex.org/W7118481026","doi":"https://doi.org/10.1137/1.9781611978971.74","title":"Finding sparse induced subgraphs on graphs of bounded induced matching treewidth","display_name":"Finding sparse induced subgraphs on graphs of bounded induced matching treewidth","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118481026","doi":"https://doi.org/10.1137/1.9781611978971.74"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.74","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.74","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"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/A5122147294","display_name":"Hans L. Bodlaender","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University"],"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","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":false,"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":"last","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["University of Copenhagen"],"affiliations":[{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5122147294"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25839793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2043","last_page":"2068"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8197000026702881,"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.8197000026702881,"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.08659999817609787,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.028200000524520874,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8877999782562256},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6377000212669373},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6133999824523926},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5681999921798706},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5285000205039978},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.48989999294281006},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.44909998774528503},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43880000710487366},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3937000036239624}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8877999782562256},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8295999765396118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7907000184059143},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6377000212669373},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6133999824523926},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5681999921798706},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5357999801635742},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5285000205039978},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.48989999294281006},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.390500009059906},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.3736000061035156},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35100001096725464},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3425000011920929},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.34060001373291016},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3337000012397766},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.29170000553131104},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.2791000008583069},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.26739999651908875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.74","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.74","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.5388386249542236,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,35,56],"induced":[1,18,36,47],"matching":[2,19,37,48],"width":[3,49],"of":[4,8,15,21,39,50,54,80,106],"a":[5,9,16,27,51,100,113,121,129],"tree":[6,52],"decomposition":[7,53],"graph":[10,115],"\\(G\\)":[11],"is":[12,44],"the":[13,45,148,157],"cardinality":[14],"largest":[17],"\\(M\\)":[20],"\\(G\\),":[22,40,116],"such":[23,154],"that":[24,29,93,136],"there":[25],"exists":[26],"bag":[28],"intersects":[30],"every":[31],"edge":[32],"in":[33,76],"\\(M\\).":[34],"treewidth":[38,139],"denoted":[41],"by":[42,61],"tree-\\(\\mu(G)\\),":[43],"minimum":[46],"\\(G\\).":[55],"parameter":[57],"tree-\\(\\mu\\)":[58],"was":[59],"introduced":[60],"Yolov":[62],"[SODA":[63],"\u201918],":[64],"who":[65],"showed":[66],"that,":[67],"for":[68,150,156],"example,":[69],"Maximum-Weight":[70,103,159],"Independent":[71],"Set":[72],"can":[73,96],"be":[74,97],"solved":[75],"polynomial-time":[77],"on":[78],"graphs":[79],"bounded":[81],"tree-\\(\\mu\\).":[82],"Lima,":[83],"Milani\u010d,":[84],"Mur\u0161i\u010d,":[85],"Okrasa,":[86],"Rz\u0105\u017cewski,":[87],"and":[88,120,124,143],"\u0160orgel":[89],"[ESA":[90],"\u201924]":[91],"conjectured":[92],"this":[94],"algorithm":[95],"generalized":[98],"to":[99,127],"meta-problem":[101],"called":[102],"Induced":[104,160],"Subgraph":[105],"Bounded":[107],"Treewidth,":[108],"where":[109],"we":[110],"are":[111,125],"given":[112],"vertex-weighted":[114],"an":[117],"integer":[118],"\\(w\\),":[119],"\\(\\mathsf{CMSO_2}\\)-sentence":[122],"\\(\\Phi\\),":[123],"asked":[126],"find":[128],"maximum-weight":[130],"set":[131],"\\(X":[132],"\\subseteq":[133],"V(G)\\)":[134],"so":[135],"\\(G[X]\\)":[137],"has":[138],"at":[140],"most":[141],"\\(w\\)":[142],"satisfies":[144],"\\(\\Phi\\).":[145],"They":[146],"proved":[147],"conjecture":[149],"some":[151],"special":[152],"cases,":[153],"as":[155],"problem":[158],"Forest.":[161]},"counts_by_year":[],"updated_date":"2026-02-23T20:09:44.859080","created_date":"2026-01-08T00:00:00"}