{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:14:09Z","timestamp":1772817249594,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE92-0027"],"award-info":[{"award-number":["ANR-20-CE92-0027"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-24-CE48-4377"],"award-info":[{"award-number":["ANR-24-CE48-4377"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["51260WL"],"award-info":[{"award-number":["51260WL"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006537","name":"Campus France","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006537","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.jcss.2026.103785","type":"journal-article","created":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T16:47:53Z","timestamp":1772038073000},"page":"103785","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximating branchwidth on parametric extensions of planarity"],"prefix":"10.1016","volume":"159","author":[{"given":"Dimitrios M.","family":"Thilikos","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Wiederrecht","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jcss.2026.103785_br0010","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s00037-011-0033-1","article-title":"Satisfiability, branch-width and Tseitin tautologies","volume":"20","author":"Alekhnovich","year":"2011","journal-title":"Comput. Complex."},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0020","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"6","key":"10.1016\/j.jcss.2026.103785_br0030","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0040","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1995.1009","article-title":"Hj\u00e1lmt\u00fdr Hafsteinsson, and Ton Kloks. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree","volume":"18","author":"Bodlaender","year":"1995","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0050","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","article-title":"Efficient and constructive algorithms for the pathwidth and treewidth of graphs","volume":"21","author":"Bodlaender","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/j.jcss.2026.103785_br0060","series-title":"Automata, Languages and Programming","first-page":"627","article-title":"Constructive linear time algorithms for branchwidth","volume":"vol. 1256","author":"Bodlaender","year":"1997"},{"key":"10.1016\/j.jcss.2026.103785_br0070","series-title":"An algorithm for the ring-routing problem. Bellcore technical memorandum","author":"Cook","year":"1993"},{"issue":"1","key":"10.1016\/j.jcss.2026.103785_br0080","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inf. Comput."},{"issue":"6","key":"10.1016\/j.jcss.2026.103785_br0090","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","article-title":"Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs","volume":"52","author":"Demaine","year":"2005","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0100","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jcss.2003.12.001","article-title":"Approximation algorithms for classes of graphs excluding single-crossing graphs as minors","volume":"69","author":"Demaine","year":"2004","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103785_br0110","article-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"2017"},{"issue":"1","key":"10.1016\/j.jcss.2026.103785_br0120","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s11083-017-9424-5","article-title":"Abstract separation systems","volume":"35","author":"Diestel","year":"2018","journal-title":"Order"},{"key":"10.1016\/j.jcss.2026.103785_br0130","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jcta.2019.05.001","article-title":"Structural submodularity and tangles in abstract separation systems","volume":"167","author":"Diestel","year":"2019","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"10.1016\/j.jcss.2026.103785_br0140","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11083-019-09499-y","article-title":"Profinite separation systems","volume":"37","author":"Diestel","year":"2020","journal-title":"Order"},{"issue":"4","key":"10.1016\/j.jcss.2026.103785_br0150","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s00493-019-3798-5","article-title":"Tangle-tree duality: in graphs, matroids and beyond","volume":"39","author":"Diestel","year":"2019","journal-title":"Combinatorica"},{"issue":"12","key":"10.1016\/j.jcss.2026.103785_br0160","doi-asserted-by":"crossref","first-page":"2737","DOI":"10.1016\/j.dam.2008.08.023","article-title":"Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm","volume":"157","author":"Dorn","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0170","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/05064299X","article-title":"Improved approximation algorithms for minimum weight vertex separators","volume":"38","author":"Feige","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103785_br0180","author":"Gavoille"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0190","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1006\/jctb.2002.2130","article-title":"Branch-width and Rota's conjecture","volume":"86","author":"Geelen","year":"2002","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0200","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1006\/jctb.2001.2082","article-title":"Branch-width and well-quasi-ordering in matroids and graphs","volume":"84","author":"Geelen","year":"2002","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcss.2026.103785_br0210","author":"Gorsky"},{"key":"10.1016\/j.jcss.2026.103785_br0220","author":"Grohe"},{"key":"10.1016\/j.jcss.2026.103785_br0230","series-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"414","article-title":"A simple algorithm for the graph minor decomposition - logic meets structural graph theory","author":"Grohe","year":"2013"},{"issue":"3","key":"10.1016\/j.jcss.2026.103785_br0240","doi-asserted-by":"crossref","DOI":"10.1145\/1367064.1367070","article-title":"Optimal branch-decomposition of planar graphs in O(n3) time","volume":"4","author":"Gu","year":"2008","journal-title":"ACM Trans. Algorithms"},{"issue":"32","key":"10.1016\/j.jcss.2026.103785_br0250","doi-asserted-by":"crossref","first-page":"4100","DOI":"10.1016\/j.tcs.2010.07.017","article-title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+\u03f5) time","volume":"412","author":"Gu","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0260","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1137\/S0097539702418589","article-title":"A parametrized algorithm for matroid branch-width","volume":"35","author":"Hlin\u011bn\u00fd","year":"2005","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2026.103785_br0270","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2005.08.005","article-title":"Branch-width, parse trees, and monadic second-order logic for matroids","volume":"96","author":"Hlin\u011bn\u00fd","year":"2006","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"10.1016\/j.jcss.2026.103785_br0280","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1137\/070685920","article-title":"Finding branch-decompositions and rank-decompositions","volume":"38","author":"Hlin\u011bn\u00fd","year":"2008","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.jcss.2026.103785_br0290","doi-asserted-by":"crossref","first-page":"2544","DOI":"10.1137\/19M1285895","article-title":"Finding branch-decompositions of matroids, hypergraphs, and more","volume":"35","author":"Jeong","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jcss.2026.103785_br0300","author":"Kawarabayashi"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0310","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.dam.2004.01.015","article-title":"Computing the branchwidth of interval graphs","volume":"145","author":"Kloks","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"10.1016\/j.jcss.2026.103785_br0320","doi-asserted-by":"crossref","first-page":"2718","DOI":"10.1016\/j.dam.2008.08.006","article-title":"Branchwidth of chordal graphs","volume":"157","author":"Paul","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0330","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph minors. X. Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"10.1016\/j.jcss.2026.103785_br0340","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","article-title":"Graph minors. XVI. Excluding a non-planar graph","volume":"89","author":"Robertson","year":"2003","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jcss.2026.103785_br0350","series-title":"Graph Structure Theory","first-page":"669","article-title":"Excluding a graph with one crossing","volume":"vol. 147","author":"Robertson","year":"1993"},{"issue":"2","key":"10.1016\/j.jcss.2026.103785_br0360","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","article-title":"Call routing and the ratcatcher","volume":"14","author":"Seymour","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcss.2026.103785_br0370","first-page":"110","article-title":"Coverability and sub-exponential parameterized algorithms in planar graphs","volume":"60","author":"Thilikos","year":"2016","journal-title":"Bull. Hell. Math. Soc."},{"key":"10.1016\/j.jcss.2026.103785_br0380","author":"Thilikos"},{"key":"10.1016\/j.jcss.2026.103785_br0390","author":"Thilikos"},{"issue":"1","key":"10.1016\/j.jcss.2026.103785_br0400","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"\u00dcber eine Eigenschaft der ebenen Komplexe","volume":"114","author":"Wagner","year":"1937","journal-title":"Math. Ann."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T11:06:30Z","timestamp":1772795190000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":40,"alternative-id":["S0022000026000310"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103785","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximating branchwidth on parametric extensions of planarity","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103785","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103785"}}