{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:22:47Z","timestamp":1775179367403,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","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":[[2019,2]]},"DOI":"10.1007\/s00493-017-3595-y","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T22:23:41Z","timestamp":1542752621000},"page":"37-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Profiles of Separations: in Graphs, Matroids, and Beyond"],"prefix":"10.1007","volume":"39","author":[{"given":"Reinhard","family":"Diestel","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Hundertmark","sequence":"additional","affiliation":[]},{"given":"Sahar","family":"Lemanczyk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"3595_CR1","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1137\/130923646","volume":"28","author":"J. Carmesin","year":"2014","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-Blocks: a connectivity invariant for graphs, SIAM J. Discrete Math.\n                           28 (2014), 1876\u20131891.","journal-title":"SIAM J. Discrete Math."},{"key":"3595_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2014.04.001","volume":"116","author":"J. Carmesin","year":"2016","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs I. Existence and algorithms, J. Combin. Theory Ser. B\n                           116 (2016), 1\u201324.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3595_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.jctb.2014.12.009","volume":"118","author":"J. Carmesin","year":"2016","unstructured":"J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs II. Essential parts, J. Combin. Theory Ser. B\n                           118 (2016), 268\u2013283.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3595_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-014-2898-5","volume":"34","author":"J. Carmesin","year":"2014","unstructured":"J. Carmesin, R. Diestel, F. Hundertmark and M. Stein: Connectivity and tree structure in finite graphs, Combinatorica\n                           34 (2014), 1\u201335.","journal-title":"Combinatorica"},{"key":"3595_CR5","volume-title":"Graph Theory (5th edition, 2016)","author":"R. Diestel","year":"2017","unstructured":"R. Diestel: Graph Theory (5th edition, 2016), Springer-Verlag, 2017. Electronic edition available at \n                    http:\/\/diestel-graph-theory.com\/."},{"key":"3595_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11083-017-9424-5","volume":"35","author":"R. Diestel","year":"2018","unstructured":"R. Diestel: Abstract separation systems, Order\n                           35 (2018), 157\u2013170.","journal-title":"Order"},{"key":"3595_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11083-017-9425-4","volume":"35","author":"R. Diestel","year":"2018","unstructured":"R. Diestel: Tree sets, Order\n                           35 (2018), 171\u2013192.","journal-title":"Order"},{"key":"3595_CR8","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1137\/16M1077763","volume":"31","author":"R. Diestel","year":"2017","unstructured":"R. Diestel, J. Erde and P. Eberenz: Duality theorem for blocks and tangles in graphs, SIAM J. Discrete Math.\n                           31 (2017), 1514\u20131528.","journal-title":"SIAM J. Discrete Math."},{"key":"3595_CR9","volume-title":"Tangle-tree duality in abstract separation systems","author":"R. Diestel","year":"2017","unstructured":"R. Diestel and S. Oum: Tangle-tree duality in abstract separation systems, arXiv:1701.02509, 2017."},{"key":"3595_CR10","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":"3595_CR11","unstructured":"R. Diestel and G. Whittle: Tangles and the Mona Lisa, arXiv:1603.06652."},{"key":"3595_CR12","volume-title":"Characteristics of profiles, MSc dissertation","author":"P. Eberenz","year":"2015","unstructured":"P. Eberenz: Characteristics of profiles, MSc dissertation, Hamburg 2015."},{"key":"3595_CR13","volume-title":"Connections in Combinatorial Optimization","author":"A. Frank","year":"2011","unstructured":"A. Frank: Connections in Combinatorial Optimization, Oxford University Press, 2011."},{"key":"3595_CR14","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.jctb.2005.11.001","volume":"96","author":"J. Geelen","year":"2006","unstructured":"J. Geelen, B. Gerards, N. Robertson and G. Whittle: Obstructions to branch- decomposition of matroids, J. Combin. Theory (Series B)\n                           96 (2006), 560\u2013570.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3595_CR15","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.jctb.2007.10.008","volume":"99","author":"J. Geelen","year":"2009","unstructured":"J. Geelen, B. Gerards and G. Whittle: Tangles, tree-decompositions and grids in matroids, J. Combin. Theory (Series B)\n                           99 (2009), 657\u2013667.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3595_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R. E. Gomory","year":"1961","unstructured":"R. E. Gomory and T. C. Hu: Multi-terminal network flows, J. Soc. Ind. Appl. Math.\n                           9 (1961), 551\u2013570.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"3595_CR17","volume-title":"Quasi-4-connected components","author":"M. Grohe","year":"2016","unstructured":"M. Grohe: Quasi-4-connected components, arXiv:1602.04505, 2016."},{"key":"3595_CR18","volume-title":"Profiles. An algebraic approach to combinatorial connectivity","author":"F. Hundertmark","year":"2011","unstructured":"F. Hundertmark: Profiles. An algebraic approach to combinatorial connectivity, \n                    https:\/\/archive.org\/stream\/arxiv-1110.6207\/1110.6207\n                    \n                  , 2011."},{"key":"3595_CR19","volume-title":"Matroid Theory","author":"J. Oxley","year":"1992","unstructured":"J. Oxley: Matroid Theory, Oxford University Press, 1992."},{"key":"3595_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"N. Robertson and P. Seymour: Graph minors. X. Obstructions to tree- decomposition, J. Combin. Theory (Series B)\n                           52 (1991), 153\u2013190.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3595_CR21","volume-title":"Graph Theory","author":"W. T. Tutte","year":"1984","unstructured":"W. T. Tutte: Graph Theory, Addison-Wesley, 1984."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3595-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3595-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3595-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T19:23:38Z","timestamp":1574277818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3595-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["3595"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3595-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"5 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}