{"id":"https://openalex.org/W2953343689","doi":"https://doi.org/10.1137/17m1112637","title":"Orthogonal Tree Decompositions of Graphs","display_name":"Orthogonal Tree Decompositions of Graphs","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2953343689","doi":"https://doi.org/10.1137/17m1112637","mag":"2953343689"},"language":"en","primary_location":{"id":"doi:10.1137/17m1112637","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1112637","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.05639","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Vida Dujmovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vida Dujmovi\u0107","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Gwena\u00ebl Joret","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gwena\u00ebl Joret","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Pat Morin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pat Morin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sergey Norin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sergey Norin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"David R. Wood","orcid":"https://orcid.org/0000-0001-8866-3041"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David R. Wood","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8866-3041","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5697,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71852371,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"32","issue":"2","first_page":"839","last_page":"863"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7839999794960022,"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.7839999794960022,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.16009999811649323,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.025200000032782555,"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/bounded-function","display_name":"Bounded function","score":0.5738999843597412},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5598999857902527},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45170000195503235},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.44699999690055847},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4449000060558319},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4345000088214874},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.42500001192092896},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4153999984264374},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.38370001316070557}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8472999930381775},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8149999976158142},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5824000239372253},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5738999843597412},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5598999857902527},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.44699999690055847},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4449000060558319},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4345000088214874},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.42500001192092896},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4153999984264374},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.38370001316070557},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.38339999318122864},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.36309999227523804},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.3610999882221222},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.3605000078678131},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3431999981403351},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.3395000100135803},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.3197000026702881},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.31619998812675476},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.30720001459121704},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.29319998621940613},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2849999964237213},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.2754000127315521},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.2732999920845032},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.2538999915122986},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.25209999084472656}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/17m1112637","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1112637","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1701.05639","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.05639","pdf_url":"https://arxiv.org/pdf/1701.05639","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/278863","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/278863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 32 (2","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.05639","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.05639","pdf_url":"https://arxiv.org/pdf/1701.05639","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3551006755","display_name":null,"funder_award_id":"418520","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320321584","display_name":"F\u00e9d\u00e9ration Wallonie-Bruxelles","ror":"https://ror.org/04q01pf08"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W13621767","https://openalex.org/W1518473637","https://openalex.org/W1971244706","https://openalex.org/W1973819999","https://openalex.org/W1974970215","https://openalex.org/W1998306675","https://openalex.org/W2007069176","https://openalex.org/W2013522700","https://openalex.org/W2024937369","https://openalex.org/W2029448190","https://openalex.org/W2031042330","https://openalex.org/W2032560040","https://openalex.org/W2033405938","https://openalex.org/W2034198559","https://openalex.org/W2034834286","https://openalex.org/W2035409201","https://openalex.org/W2037789845","https://openalex.org/W2054492295","https://openalex.org/W2067431706","https://openalex.org/W2083807544","https://openalex.org/W2087083200","https://openalex.org/W2109298068","https://openalex.org/W2127060213","https://openalex.org/W2145062394","https://openalex.org/W2153476954","https://openalex.org/W2162557634","https://openalex.org/W2294414813","https://openalex.org/W2345501529","https://openalex.org/W2480148066","https://openalex.org/W2519651985","https://openalex.org/W2766116208","https://openalex.org/W2912205465","https://openalex.org/W2962696666","https://openalex.org/W2962961215","https://openalex.org/W2963368860","https://openalex.org/W2963755366","https://openalex.org/W3030259189","https://openalex.org/W4213071722","https://openalex.org/W4252763010"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"graphs":[3,60,72,161],"that":[4,12,32,85,104,108,150,177],"have":[5,151,162],"two":[6,152],"tree":[7,43,111],"decompositions":[8,154],"with":[9,23,50,61,73,118,155],"the":[10,16,27,38,86,90,93,134,167],"property":[11],"every":[13,24,33,54,105],"bag":[14,25],"from":[15,26],"first":[17],"decomposition":[18,44,49,95,112,117],"has":[19,41,109,121],"a":[20,42,46,62,68,78,110,114,125,129,138],"bounded-size":[21],"intersection":[22],"second":[28],"decomposition.":[29],"We":[30,101],"show":[31,103,176],"graph":[34,107,139,148],"in":[35,67,77,92,140],"each":[36],"of":[37,65,89,137,142],"following":[39],"classes":[40,149],"and":[45,113,159],"linear-sized":[47,115],"path":[48,94,116,153],"bounded":[51,119,156],"intersections:":[52],"(1)":[53],"proper":[55],"minor-closed":[56],"class,":[57,171],"(2)":[58],"string":[59],"linear":[63,74],"number":[64,76,136],"crossings":[66],"fixed":[69,79],"surface,":[70],"(3)":[71],"crossing":[75,135],"surface.":[80],"Here":[81],"\u201clinear":[82],"size\u201d":[83],"means":[84],"total":[87],"size":[88],"bags":[91],"is":[96],"$O(n)$":[97],"for":[98,166],"$n$-vertex":[99,106],"graphs.":[100],"then":[102],"intersections":[120],"$O(\\sqrt{n})$":[122],"treewidth.":[123,144],"As":[124],"corollary,":[126],"we":[127,146,175],"conclude":[128],"new":[130],"lower":[131],"bound":[132],"on":[133],"terms":[141],"its":[143],"Finally,":[145],"consider":[147],"intersections.":[157],"Trees":[158],"outerplanar":[160],"this":[163],"property.":[164],"But":[165],"next":[168],"most":[169],"simple":[170],"series":[172],"parallel":[173],"graphs,":[174],"no":[178],"such":[179],"result":[180],"holds.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2019-06-27T00:00:00"}