{"id":"https://openalex.org/W2153209610","doi":"https://doi.org/10.1007/3-540-45471-3_40","title":"Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition","display_name":"Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2153209610","doi":"https://doi.org/10.1007/3-540-45471-3_40","mag":"2153209610"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45471-3_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45471-3_40","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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"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":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069504394","display_name":"Udi Rotics","orcid":null},"institutions":[{"id":"https://openalex.org/I55693919","display_name":"Netanya Academic College","ror":"https://ror.org/03d7p8g51","country_code":"IL","type":"education","lineage":["https://openalex.org/I55693919"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Udi Rotics","raw_affiliation_strings":["School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100, Netanya, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100, Netanya, Israel","institution_ids":["https://openalex.org/I55693919"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5136,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62387801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"388","last_page":"397"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9975000023841858,"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":"semigroups and automata theory","score":0.9975000023841858,"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/treewidth","display_name":"Treewidth","score":0.9159430265426636},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.8436434268951416},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6103289723396301},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.5452128648757935},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5377099514007568},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5231881737709045},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.507337749004364},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4956151247024536},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47585126757621765},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47471582889556885},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.462923526763916},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4321790039539337},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.418127179145813},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.41718336939811707},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41692811250686646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37900394201278687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3752598762512207},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.30674904584884644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27104663848876953},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08153912425041199},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07003375887870789},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06392103433609009}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9159430265426636},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.8436434268951416},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6103289723396301},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.5452128648757935},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5377099514007568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5231881737709045},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.507337749004364},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4956151247024536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47585126757621765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47471582889556885},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.462923526763916},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4321790039539337},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.418127179145813},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.41718336939811707},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41692811250686646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37900394201278687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3752598762512207},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.30674904584884644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27104663848876953},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08153912425041199},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07003375887870789},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06392103433609009},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45471-3_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45471-3_40","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/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1480846237","https://openalex.org/W1487575948","https://openalex.org/W1569612812","https://openalex.org/W1576293797","https://openalex.org/W1985733932","https://openalex.org/W2012154006","https://openalex.org/W2012545074","https://openalex.org/W2014488291","https://openalex.org/W2027388354","https://openalex.org/W2027566319","https://openalex.org/W2029448190","https://openalex.org/W2034501206","https://openalex.org/W2040405987","https://openalex.org/W2055691408","https://openalex.org/W2085550081","https://openalex.org/W2086058377","https://openalex.org/W2091208300","https://openalex.org/W2117657015","https://openalex.org/W2123596476","https://openalex.org/W2139404577","https://openalex.org/W2153362081","https://openalex.org/W2170633983"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W1572255008","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W1576158606","https://openalex.org/W2055691408","https://openalex.org/W2153209610"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}