{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:17Z","timestamp":1725880577538},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_7","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"81-92","source":"Crossref","is-referenced-by-count":1,"title":["Tangle and Maximal Ideal"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Yamazaki","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"7_CR1","unstructured":"Adler, I.: Games for width parameters and monotonicity. arXiv preprint arXiv:0906.3857 (2009)"},{"issue":"20","key":"7_CR2","doi-asserted-by":"crossref","first-page":"6000","DOI":"10.1016\/j.disc.2009.04.033","volume":"309","author":"O Amini","year":"2009","unstructured":"Amini, O., Mazoit, F., Nisse, N., Thomass\u00e9, S.: Submodular partition functions. Discrete Math. 309(20), 6000\u20136008 (2009)","journal-title":"Discrete Math."},{"issue":"06","key":"7_CR3","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1017\/S0963548302005369","volume":"11","author":"P Bellenbaum","year":"2002","unstructured":"Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Comb. Probab. Comput. 11(06), 541\u2013547 (2002)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"7_CR4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a forest. J. Comb. Theory Ser. B 52(2), 274\u2013283 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1007\/978-1-4419-7997-1_76","volume-title":"Handbook of Combinatorial Optimization","author":"A Bonato","year":"2013","unstructured":"Bonato, A., Yang, B.: Graph searching and related problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1511\u20131558. Springer, Heidelberg (2013)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.jctb.2013.03.002","volume":"103","author":"B Clark","year":"2013","unstructured":"Clark, B., Whittle, G.: Tangles, trees, and flowers. J. Comb. Theory Ser. B 103(3), 385\u2013407 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1090\/conm\/197\/02530","volume":"197","author":"J Dharmatilake","year":"1996","unstructured":"Dharmatilake, J.: A min-max theorem using matroid separations. Matroid Theory Contemp. Math. 197, 333\u2013342 (1996)","journal-title":"Matroid Theory Contemp. Math."},{"key":"7_CR8","unstructured":"Diestel, R.: Ends and tangles. arXiv preprint arXiv:1510.04050v2 (2015)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Diestel, R., Oum, S.: Unifying duality theorems for width parameters in graphs and matroids. I. Weak and strong duality. arXiv preprint arXiv:1406.3797 (2014)","DOI":"10.1007\/978-3-319-12340-0_1"},{"issue":"2","key":"7_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0166-218X(02)00459-6","volume":"131","author":"F Fomin","year":"2003","unstructured":"Fomin, F., Thilikos, D.: On the monotonicity of games generated by symmetric submodular functions. Discrete Appl. Math. 131(2), 323\u2013335 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.jctb.2005.11.001","volume":"96","author":"J Geelen","year":"2006","unstructured":"Geelen, J., Gerards, B., Robertson, N., Whittle, G.: Obstructions to branch-decomposition of matroids. J. Comb. Theory Ser. B 96(4), 560\u2013570 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR12","unstructured":"Grohe, M.: Tangled up in blue (a survey on connectivity, decompositions, and tangles). arXiv preprint arXiv:1605.06704 (2016)"},{"issue":"13","key":"7_CR13","first-page":"332","volume":"28","author":"T Leinster","year":"2013","unstructured":"Leinster, T.: Codensity and the ultrafilter monad. Theory Appl. Categories 28(13), 332\u2013370 (2013)","journal-title":"Theory Appl. Categories"},{"issue":"3","key":"7_CR14","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.ejc.2009.09.004","volume":"31","author":"L Lyaudet","year":"2010","unstructured":"Lyaudet, L., Mazoit, F., Thomass\u00e9, S.: Partitions versus sets: a case of duality. Eur. J. Comb. 31(3), 681\u2013687 (2010)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"7_CR15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.jctb.2006.06.006","volume":"97","author":"S Oum","year":"2007","unstructured":"Oum, S., Seymour, P.: Testing branch-width. J. Comb. Theory Ser. B 97(3), 385\u2013393 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR16","unstructured":"Oum, S., Seymour, P.: Corrigendum to our paper \u201ctesting branch-width\" (2009)"},{"key":"7_CR17","first-page":"87","volume":"241","author":"B Reed","year":"1997","unstructured":"Reed, B.: Tree width and tangles: a new connectivity measure and some applications. Surv. Comb. 241, 87\u2013162 (1997)","journal-title":"Surv. Comb."},{"issue":"2","key":"7_CR18","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(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"7_CR19","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"P Seymour","year":"1993","unstructured":"Seymour, P., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"7_CR20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P Seymour","year":"1994","unstructured":"Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"7_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85820-8","volume-title":"Boolean Algebras","author":"R Sikorski","year":"1969","unstructured":"Sikorski, R.: Boolean Algebras. Springer, Heidelberg (1969)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T17:30:34Z","timestamp":1568827834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}