{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:23Z","timestamp":1759063763003},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T00:00:00Z","timestamp":1297728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10589-011-9397-z","type":"journal-article","created":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T15:42:43Z","timestamp":1297698163000},"page":"1211-1229","source":"Crossref","is-referenced-by-count":7,"title":["A combinatorial optimization algorithm for solving the\u00a0branchwidth problem"],"prefix":"10.1007","volume":"51","author":[{"given":"J. Cole","family":"Smith","sequence":"first","affiliation":[]},{"given":"Elif","family":"Ulusal","sequence":"additional","affiliation":[]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,15]]},"reference":[{"key":"9397_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"9397_CR2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/1.9781611972887.15","volume-title":"Proceedings of the 2008 SIAM Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Z. Bian","year":"2008","unstructured":"Bian, Z., Gu, Q., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 2008 SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 152\u2013165. SIAM, Philadelphia (2008)"},{"key":"9397_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/11841036_60","volume-title":"Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006)","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006). Lecture Notes in Computer Science, vol.\u00a04168, pp. 672\u2013683. Springer, Berlin (2006)"},{"issue":"1","key":"9397_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00117","volume":"10","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. J. Graph Algorithms Appl. 10(1), 5\u201349 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"9397_CR5","unstructured":"Cook, W.J., Seymour, P.D.: An algorithm for the ring-router problem. Technical report, Bellcore (1994)"},{"issue":"3","key":"9397_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W.J. Cook","year":"2003","unstructured":"Cook, W.J., Seymour, P.D.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(3), 233\u2013248 (2003)","journal-title":"INFORMS J. Comput."},{"key":"9397_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs I: recognizable set of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9397_CR8","first-page":"56","volume-title":"Lecture Notes in Computer Science","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Lecture Notes in Computer Science, vol.\u00a02996, pp. 56\u201367. Springer, Berlin (2004)"},{"key":"9397_CR9","unstructured":"Fomin, F.V., Fraigniaud, P., Thilikos, D.M.: The price of connectedness in expansions. Technical Report 273, Department of Informatics, University of Bergen, Bergen, Norway, May 2004"},{"issue":"12","key":"9397_CR10","doi-asserted-by":"crossref","first-page":"2726","DOI":"10.1016\/j.dam.2008.08.009","volume":"157","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Mazoit, F., Todinca, I.: Computing branchwidth via efficient triangulations and blocks. Discrete Appl. Math. 157(12), 2726\u20132736 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9397_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477\u2013495 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"9397_CR12","first-page":"31","volume":"159","author":"I.V. Hicks","year":"2002","unstructured":"Hicks, I.V.: Branchwidth heuristics. Congr. Numer. 159, 31\u201350 (2002)","journal-title":"Congr. Numer."},{"issue":"1","key":"9397_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.10099","volume":"43","author":"I.V. Hicks","year":"2004","unstructured":"Hicks, I.V.: Branch decompositions and minor containment. Networks 43(1), 1\u20139 (2004)","journal-title":"Networks"},{"issue":"2","key":"9397_CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.20050","volume":"45","author":"I.V. Hicks","year":"2005","unstructured":"Hicks, I.V.: Graphs, branchwidth, and tangles! Oh my! Networks 45(2), 55\u201360 (2005)","journal-title":"Networks"},{"issue":"4","key":"9397_CR15","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1287\/ijoc.1040.0074","volume":"17","author":"I.V. Hicks","year":"2005","unstructured":"Hicks, I.V.: Planar branch decompositions II: the cycle method. INFORMS J. Comput. 17(4), 413\u2013421 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9397_CR16","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-Complete. SIAM J. Algebr. Discrete Methods 7, 505\u2013512 (1986)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9397_CR17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52, 153\u2013190 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9397_CR18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B 63, 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"9397_CR19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9397-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9397-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9397-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:40Z","timestamp":1559302600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9397-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,15]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9397"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9397-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,15]]}}}