{"id":"https://openalex.org/W1590656880","doi":"https://doi.org/10.1007/11604686_9","title":"Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time","display_name":"Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1590656880","doi":"https://doi.org/10.1007/11604686_9","mag":"1590656880"},"language":"en","primary_location":{"id":"doi:10.1007/11604686_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_9","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":"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/A5018511843","display_name":"Daniel Meister","orcid":"https://orcid.org/0000-0002-3149-1442"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Meister","raw_affiliation_strings":["Bayerische Julius-Maximilians-Universitaet Wuerzburg, 97074, Wuerzburg, Germany"],"affiliations":[{"raw_affiliation_string":"Bayerische Julius-Maximilians-Universitaet Wuerzburg, 97074, Wuerzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018511843"],"corresponding_institution_ids":["https://openalex.org/I25974101"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1145,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78523788,"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":"91","last_page":"102"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991999864578247,"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.9908000230789185,"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/combinatorics","display_name":"Combinatorics","score":0.8089858293533325},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7365164756774902},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.7231972217559814},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7223566770553589},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5801780819892883},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.5386509895324707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47993355989456177},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.4782330393791199},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46963000297546387},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.4298628866672516},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.42751505970954895},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.41198021173477173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39723992347717285},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3490632474422455},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2846301794052124},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11552008986473083},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.0937005877494812}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8089858293533325},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7365164756774902},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.7231972217559814},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7223566770553589},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5801780819892883},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5386509895324707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47993355989456177},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.4782330393791199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46963000297546387},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.4298628866672516},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.42751505970954895},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.41198021173477173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39723992347717285},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3490632474422455},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2846301794052124},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11552008986473083},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.0937005877494812},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11604686_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11604686_9","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":17,"referenced_works":["https://openalex.org/W1517921658","https://openalex.org/W1533693718","https://openalex.org/W1589421353","https://openalex.org/W1985733932","https://openalex.org/W2012154006","https://openalex.org/W2027566319","https://openalex.org/W2037106315","https://openalex.org/W2045187717","https://openalex.org/W2085550081","https://openalex.org/W2086119402","https://openalex.org/W2089465933","https://openalex.org/W2089941644","https://openalex.org/W2091208300","https://openalex.org/W2143474538","https://openalex.org/W2165605193","https://openalex.org/W2320198223","https://openalex.org/W3022074675"],"related_works":["https://openalex.org/W2231732554","https://openalex.org/W1578113210","https://openalex.org/W2966902162","https://openalex.org/W2397003135","https://openalex.org/W2952286285","https://openalex.org/W3022162048","https://openalex.org/W2090497853","https://openalex.org/W1590656880","https://openalex.org/W1783801030","https://openalex.org/W2125939925"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}