{"id":"https://openalex.org/W3139402347","doi":"https://doi.org/10.1007/s00453-007-9131-5","title":"I/O-Efficient Algorithms for Graphs of Bounded Treewidth","display_name":"I/O-Efficient Algorithms for Graphs of Bounded Treewidth","publication_year":2007,"publication_date":"2007-11-30","ids":{"openalex":"https://openalex.org/W3139402347","doi":"https://doi.org/10.1007/s00453-007-9131-5","mag":"3139402347"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9131-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9131-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.library.carleton.ca/pub/4404","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019738080","display_name":"Norbert Zeh","orcid":"https://orcid.org/0000-0002-0562-1629"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Norbert Zeh","raw_affiliation_strings":["Faculty of Computer Science, Dalhousie University, Halifax, NS, B3H 2Y5, Canada"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Dalhousie University, Halifax, NS, B3H 2Y5, Canada","institution_ids":["https://openalex.org/I129902397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103136561"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.36573098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"54","issue":"3","first_page":"413","last_page":"469"},"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.9994000196456909,"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.9990000128746033,"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.9250590801239014},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6820662617683411},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6498019695281982},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5662171840667725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5210503935813904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4695943593978882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46298256516456604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4317692518234253},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4251924157142639},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3910868167877197},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3886529207229614},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.289606511592865},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.25545430183410645},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.05981513857841492}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9250590801239014},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6820662617683411},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6498019695281982},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5662171840667725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5210503935813904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4695943593978882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46298256516456604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4317692518234253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4251924157142639},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3910868167877197},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3886529207229614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.289606511592865},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.25545430183410645},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.05981513857841492},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9131-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9131-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:carleton.ca:4404","is_oa":true,"landing_page_url":"https://ir.library.carleton.ca/pub/4404","pdf_url":null,"source":{"id":"https://openalex.org/S4306402514","display_name":"Carleton University's Institutional Repository (MacOdrum Library, Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica vol. 54 no. 3, pp. 413-469","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:carleton.ca:4404","is_oa":true,"landing_page_url":"https://ir.library.carleton.ca/pub/4404","pdf_url":null,"source":{"id":"https://openalex.org/S4306402514","display_name":"Carleton University's Institutional Repository (MacOdrum Library, Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica vol. 54 no. 3, pp. 413-469","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W64329647","https://openalex.org/W143512583","https://openalex.org/W358088974","https://openalex.org/W1556590257","https://openalex.org/W1598859508","https://openalex.org/W1982231222","https://openalex.org/W1986843945","https://openalex.org/W1991477862","https://openalex.org/W1991755800","https://openalex.org/W1993522985","https://openalex.org/W1998017993","https://openalex.org/W2007572995","https://openalex.org/W2015326607","https://openalex.org/W2017492235","https://openalex.org/W2018876684","https://openalex.org/W2020158648","https://openalex.org/W2022637272","https://openalex.org/W2027981423","https://openalex.org/W2035331304","https://openalex.org/W2037688351","https://openalex.org/W2046441184","https://openalex.org/W2057839002","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2068361557","https://openalex.org/W2086119402","https://openalex.org/W2088116875","https://openalex.org/W2090103608","https://openalex.org/W2100410715","https://openalex.org/W2104734478","https://openalex.org/W2115666768","https://openalex.org/W2116580117","https://openalex.org/W2125058377","https://openalex.org/W2136354771","https://openalex.org/W2138841062","https://openalex.org/W2141883265","https://openalex.org/W2143406303","https://openalex.org/W2150235218","https://openalex.org/W2150867067","https://openalex.org/W2151617868","https://openalex.org/W2153789027","https://openalex.org/W2168395296","https://openalex.org/W2175110005","https://openalex.org/W2752573522","https://openalex.org/W2799004609","https://openalex.org/W3145128584","https://openalex.org/W4213214460","https://openalex.org/W4213368513","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1480846237","https://openalex.org/W1976784955","https://openalex.org/W239742334","https://openalex.org/W2012687409","https://openalex.org/W2889180046","https://openalex.org/W2091382007","https://openalex.org/W2088441646","https://openalex.org/W1976463682","https://openalex.org/W2029854525","https://openalex.org/W1544821268"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"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"}