{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T13:43:25Z","timestamp":1768139005255,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T00:00:00Z","timestamp":1486944000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00493-016-3516-5","type":"journal-article","created":{"date-parts":[[2017,2,13]],"date-time":"2017-02-13T01:44:40Z","timestamp":1486950280000},"page":"381-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Connected Tree-Width"],"prefix":"10.1007","volume":"38","author":[{"given":"Reinhard","family":"Diestel","sequence":"first","affiliation":[]},{"given":"Malte","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,13]]},"reference":[{"key":"3516_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/15427951.2016.1182952","volume":"12","author":"A. B. Adcock","year":"2016","unstructured":"A. B. Adcock, B. D. Sullivan and M. W. Mahoney: Tree decompositions and social graphs, Internet Mathematics 12(5), 2016.","journal-title":"Internet Mathematics"},{"key":"3516_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548302005369","volume":"11","author":"P. Bellenbaum","year":"2002","unstructured":"P. Bellenbaum and R. Diestel: Two short proofs concerning tree-decompositions, Comb., Probab. Comput.\n                           11 (2002), 1\u20137.","journal-title":"Comb., Probab. Comput."},{"key":"3516_CR3","volume-title":"Proceedings of the twenty-fourth annual symposium on computational geometry","author":"V. Chepoi","year":"2008","unstructured":"V. Chepoi, F. Dragan, B. Estellon, M. Habib and Y. Vax\u00e8s: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs, in: Proceedings of the twenty-fourth annual symposium on computational geometry, SCG\u2019 08, 59\u201368, New York, NY, USA, 2008. ACM."},{"key":"3516_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"R. Diestel: Graph Theory, Springer, 4th edition, 2010."},{"key":"3516_CR5","volume-title":"Tangle-tree duality: in graphs, matroids and beyond","author":"R. Diestel","year":"2017","unstructured":"R. Diestel and S. Oum: Tangle-tree duality: in graphs, matroids and beyond, arXiv: 1701.02651, (2017)"},{"key":"3516_CR6","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y. Dourisboure","year":"2007","unstructured":"Y. Dourisboure and C. Gavoille: Tree-decompositions with bags of small diameter, Discrete Math.\n                           307 (2007), 2008\u20132029.","journal-title":"Discrete Math."},{"key":"3516_CR7","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1137\/15M1044618","volume":"30","author":"M. Hamann","year":"2016","unstructured":"M. Hamann and D. Weissauer: Bounding connected tree-width, SIAM J. Discrete Math.\n                           30 (2016), 1391\u20131400.","journal-title":"SIAM J. Discrete Math."},{"key":"3516_CR8","volume-title":"Connected tree-width: a new parameter for graph decomposition","author":"P. Jegou","year":"2014","unstructured":"P. Jegou and C. Terrioux: Connected tree-width: a new parameter for graph decomposition, http:\/\/www.cs.uic.edu\/pub\/Isaim2014\/WebPreferences\/ISAIM2014_Jegou_Terrioux.pdf, 2014."},{"key":"3516_CR9","first-page":"403","volume-title":"CP 2014","author":"P. Jegou","year":"2014","unstructured":"P. Jegou and C. Terrioux: Tree-decompositions with connected clusters for solving constraint networks, in CP 2014 (B. O\u2019Sullivan, ed.), volume 8656, 403\u2013407, Springer Lecture Notes in Computer Science, 2014."},{"key":"3516_CR10","volume-title":"Connected tree-width","author":"M. M\u00fcller","year":"2012","unstructured":"M. M\u00fcller: Connected tree-width, arXiv:1211.7353, 2012."},{"key":"3516_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P. Seymour","year":"1993","unstructured":"P. Seymour and R. Thomas: Graph searching and a min-max theorem for treewidth, J. Combin. Theory (Series B)\n                           58 (1993), 22\u201333.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3516_CR12","volume-title":"Personal communication","author":"B. Sullivan","year":"2013","unstructured":"B. Sullivan: Personal communication, Dagstuhl 2013."},{"key":"3516_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(90)90130-R","volume":"48","author":"R. Thomas","year":"1990","unstructured":"R. Thomas: A Menger-like property of tree-width; the finite case, J. Combin. Theory (Series B)\n                           48 (1990), 67\u201376.","journal-title":"J. Combin. Theory (Series B)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3516-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3516-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3516-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T03:08:00Z","timestamp":1526094480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3516-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,13]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["3516"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3516-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,13]]}}}