{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:01Z","timestamp":1725574081035},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_37","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"444-454","source":"Crossref","is-referenced-by-count":3,"title":["A Local Search Algorithm for Branchwidth"],"prefix":"10.1007","author":[{"given":"Arnold","family":"Overwijk","sequence":"first","affiliation":[]},{"given":"Eelko","family":"Penninkx","sequence":"additional","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigen values and expanders. Combinatorica\u00a06, 83\u201396 (1986)","journal-title":"Combinatorica"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume-title":"Algorithmic Aspects in Information and Management","author":"E.H. Bachoore","year":"2006","unstructured":"Bachoore, E.H., Bodlaender, H.L.: A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 255\u2013266. Springer, Heidelberg (2006)"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-68552-4_7","volume-title":"Experimental Algorithms","author":"Z. Bian","year":"2008","unstructured":"Bian, Z., Gu, Q.-P.: Computing branch decompositions of large planar graphs. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 87\u2013100. Springer, Heidelberg (2008)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30577-4_1","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L.: Discovering treewidth. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"2006","unstructured":"Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 1\u201314. Springer, Heidelberg (2006)"},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal\u00a051(3), 255\u2013269 (2008)","journal-title":"The Computer Journal"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H.L. Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Information and Computation\u00a0208, 259\u2013275 (2010)","journal-title":"Information and Computation"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 627\u2013637. Springer, Heidelberg (1997)"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F. Clautiaux","year":"2004","unstructured":"Clautiaux, F., Moukrim, A., N\u00e9gre, S., Carlier, J.: Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Operations Research\u00a038, 13\u201326 (2004)","journal-title":"RAIRO Operations Research"},{"key":"37_CR12","unstructured":"Cook, W., Seymour, P.D.: An algorithm for the ring-routing problem. Bellcore technical memorandum, Bellcore (1993)"},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/ijoc.15.3.233.16078","volume":"15","author":"W. Cook","year":"2003","unstructured":"Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. INFORMS Journal on Computing\u00a015(3), 233\u2013248 (2003)","journal-title":"INFORMS Journal on Computing"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/11561071_11","volume-title":"Algorithms \u2013 ESA 2005","author":"F. Dorn","year":"2005","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1016\/j.dam.2008.08.023","volume":"157","author":"F. Dorn","year":"2009","unstructured":"Dorn, F., Telle, J.A.: Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm. Discrete Applied Mathematics\u00a0157, 2737\u20132746 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR16","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0157, 2726\u20132736 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/jgt.20121","volume":"51","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. Journal of Graph Theory\u00a051, 53\u201381 (2006)","journal-title":"Journal of Graph Theory"},{"key":"37_CR18","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Chickering, D.M., Halpern, J.Y. (eds.) Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 201\u2013208. AUAI Press (2004)"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11523468_31","volume-title":"Automata, Languages and Programming","author":"Q.-P. Gu","year":"2005","unstructured":"Gu, Q.-P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n 3) time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 373\u2013384. Springer, Heidelberg (2005)"},{"key":"37_CR20","first-page":"31","volume":"159","author":"I.V. Hicks","year":"2002","unstructured":"Hicks, I.V.: Branchwidth heuristics. Congressus Numerantium\u00a0159, 31\u201350 (2002)","journal-title":"Congressus Numerantium"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/ijoc.1040.0075","volume":"17","author":"I.V. Hicks","year":"2005","unstructured":"Hicks, I.V.: Planar branch decompositions I: The ratcatcher. INFORMS Journal on Computing\u00a017, 402\u2013412 (2005)","journal-title":"INFORMS Journal on Computing"},{"key":"37_CR22","doi-asserted-by":"publisher","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 Journal on Computing\u00a017, 413\u2013421 (2005)","journal-title":"INFORMS Journal on Computing"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Hicks, I.V., Koster, A.M.C.A., Koloto\u011flu, E.: Branch and tree decomposition techniques for discrete optimization. In: Smith, J.C. (ed.) TutORials 2005. INFORMS Tutorials in Operations Research Series, INFORMS Annual Meeting, ch.1, pp. 1\u201329 (2005)","DOI":"10.1287\/educ.1053.0017"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. The Computer Journal\u00a051, 326\u2013362 (2008)","journal-title":"The Computer Journal"},{"key":"37_CR25","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01890544","volume":"2","author":"U. Kj\u00e6rulff","year":"1992","unstructured":"Kj\u00e6rulff, U.: Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing\u00a02, 2\u201317 (1992)","journal-title":"Statistics and Computing"},{"key":"37_CR26","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"37_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B\u00a052, 153\u2013190 (1991)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"37_CR28","unstructured":"R\u00f6hrig, H.: Tree decomposition: A feasibility study. Master\u2019s thesis, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1998)"},{"issue":"2","key":"37_CR29","doi-asserted-by":"publisher","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\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T15:02:30Z","timestamp":1559919750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}