{"id":"https://openalex.org/W2113901576","doi":"https://doi.org/10.1007/s00453-007-9056-z","title":"Treewidth Lower Bounds with Brambles","display_name":"Treewidth Lower Bounds with Brambles","publication_year":2007,"publication_date":"2007-10-05","ids":{"openalex":"https://openalex.org/W2113901576","doi":"https://doi.org/10.1007/s00453-007-9056-z","mag":"2113901576"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9056-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9056-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9056-z.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9056-z.pdf","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":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB, Utrecht, The Netherlands","Utrecht University, Department of Information and Computing Sciences, P.O. Box 80.089, 3508, Utrecht, TB, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht University, Department of Information and Computing Sciences, P.O. Box 80.089, 3508, Utrecht, TB, The Netherlands#TAB#","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052039079","display_name":"Alexander Grigoriev","orcid":"https://orcid.org/0000-0002-8391-235X"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Grigoriev","raw_affiliation_strings":["Department of Quantitative Economics, University of Maastricht, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","University of Maastricht, Department of Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Economics, University of Maastricht, P.O. Box 616, 6200, MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"University of Maastricht, Department of Quantitative Economics, P.O. Box 616, 6200, Maastricht, MD, The Netherlands#TAB#","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043443150","display_name":"Arie M. C. A. Koster","orcid":"https://orcid.org/0000-0002-8035-7012"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arie M. C. A. Koster","raw_affiliation_strings":["Zuse Institute Berlin (ZIB), Takustra\u00dfe 7, 14195, Berlin-Dahlem, Germany","Zuse Institute Berlin (ZIB), P.O. Box 616, Takustra\u00dfe 7, 14195, Berlin-Dahlem, MD, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Zuse Institute Berlin (ZIB), Takustra\u00dfe 7, 14195, Berlin-Dahlem, Germany","institution_ids":["https://openalex.org/I195893171"]},{"raw_affiliation_string":"Zuse Institute Berlin (ZIB), P.O. Box 616, Takustra\u00dfe 7, 14195, Berlin-Dahlem, MD, Germany#TAB#","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":5.2669,"has_fulltext":true,"cited_by_count":44,"citation_normalized_percentile":{"value":0.95736654,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"51","issue":"1","first_page":"81","last_page":"98"},"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.9944000244140625,"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.9879000186920166,"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.9566198587417603},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7420234084129333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7174663543701172},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.6696874499320984},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.6501697301864624},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6350080370903015},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6345740556716919},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6213670372962952},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.6188647747039795},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5786916017532349},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5015270709991455},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49458882212638855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47126221656799316},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47064560651779175},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42399317026138306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.295265257358551},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16704687476158142}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9566198587417603},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7420234084129333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7174663543701172},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.6696874499320984},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.6501697301864624},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6350080370903015},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6345740556716919},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6213670372962952},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.6188647747039795},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5786916017532349},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5015270709991455},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49458882212638855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47126221656799316},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47064560651779175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42399317026138306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.295265257358551},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16704687476158142},{"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-9056-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9056-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9056-z.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/a3065590-3d87-4967-b64b-5f83547a4333","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/a3065590-3d87-4967-b64b-5f83547a4333","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bodlaender, H L, Grigoriev, A & Koster, A M C A 2008, 'Treewidth lower bounds with brambles.', Algorithmica, vol. 51, no. 1, pp. 81-98. https://doi.org/10.1007/s00453-007-9056-z","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00453-007-9056-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-007-9056-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-007-9056-z.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3179101803","display_name":null,"funder_award_id":"GR 883/9-3, GR 883/9-4","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2113901576.pdf","grobid_xml":"https://content.openalex.org/works/W2113901576.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W976211528","https://openalex.org/W1479863711","https://openalex.org/W1506542774","https://openalex.org/W1549709917","https://openalex.org/W1551907897","https://openalex.org/W1559538863","https://openalex.org/W1628915153","https://openalex.org/W1669562806","https://openalex.org/W1934849835","https://openalex.org/W1977545325","https://openalex.org/W1985733932","https://openalex.org/W1987374783","https://openalex.org/W1992752571","https://openalex.org/W2005079828","https://openalex.org/W2011039300","https://openalex.org/W2011911122","https://openalex.org/W2012687409","https://openalex.org/W2019137761","https://openalex.org/W2023039219","https://openalex.org/W2029448190","https://openalex.org/W2047871605","https://openalex.org/W2048794017","https://openalex.org/W2059372025","https://openalex.org/W2066867008","https://openalex.org/W2079966248","https://openalex.org/W2085348754","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2103080151","https://openalex.org/W2111930185","https://openalex.org/W2113658811","https://openalex.org/W2120266101","https://openalex.org/W2125547222","https://openalex.org/W2151120603","https://openalex.org/W2151721933","https://openalex.org/W2155920587","https://openalex.org/W2157362754","https://openalex.org/W2165303918","https://openalex.org/W2167377888","https://openalex.org/W2174973502","https://openalex.org/W2552070334","https://openalex.org/W2561675875","https://openalex.org/W2913596432","https://openalex.org/W2914617426","https://openalex.org/W3141776272","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W143512583","https://openalex.org/W4285428820","https://openalex.org/W2803227791","https://openalex.org/W1538433552"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,85],"present":[4],"a":[5,26,34,62,75],"new":[6],"technique":[7,16],"for":[8,12,45,50,55,65],"computing":[9],"lower":[10,63,99],"bounds":[11],"graph":[13,27],"treewidth.":[14],"Our":[15],"is":[17,29,58,72],"based":[18],"on":[19,87],"the":[20,23,30,67,80,94],"fact":[21],"that":[22,71,91,93],"treewidth":[24,68],"of":[25,33,36],"G":[28,37],"maximum":[31],"order":[32],"bramble":[35],"minus":[38],"one.":[39],"We":[40],"give":[41,61,97],"two":[42],"algorithms:":[43],"one":[44,49],"general":[46],"graphs,":[47],"and":[48,69],"planar":[51,56,108],"graphs.":[52,109],"The":[53],"algorithm":[54],"graphs":[57],"shown":[59],"to":[60,105],"bound":[64],"both":[66,83],"branchwidth":[70],"at":[73],"most":[74],"constant":[76],"factor":[77],"away":[78],"from":[79],"optimum.":[81],"For":[82],"algorithms,":[84],"report":[86],"extensive":[88],"computational":[89],"experiments":[90],"show":[92],"algorithms":[95],"often":[96],"excellent":[98],"bounds,":[100],"in":[101],"particular":[102],"when":[103],"applied":[104],"(close":[106],"to)":[107]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}