{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:56Z","timestamp":1750308536465,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,14]],"date-time":"2015-06-14T00:00:00Z","timestamp":1434240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GR 1492\/14-1"],"award-info":[{"award-number":["GR 1492\/14-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,14]]},"DOI":"10.1145\/2746539.2746587","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T15:35:56Z","timestamp":1433345756000},"page":"683-692","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing with Tangles"],"prefix":"10.1145","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Canonical tree-decompositions of finite graphs I. Existence and algorithms. ArXiv, arXiv:1305.4668v3 {math.CO}","author":"Carmesin J.","year":"2013","unstructured":"J. Carmesin , R. Diestel , M. Hamann , and F. Hundertmark . Canonical tree-decompositions of finite graphs I. Existence and algorithms. ArXiv, arXiv:1305.4668v3 {math.CO} , 2013 . J. Carmesin, R. Diestel, M. Hamann, and F. Hundertmark. Canonical tree-decompositions of finite graphs I. Existence and algorithms. ArXiv, arXiv:1305.4668v3 {math.CO}, 2013."},{"key":"e_1_3_2_1_2_1","volume-title":"Canonical tree-decompositions of finite graphs II. Essential parts. ArXiv, arXiv:1305.4909v2 {math.CO}","author":"Carmesin J.","year":"2013","unstructured":"J. Carmesin , R. Diestel , M. Hamann , and F. Hundertmark . Canonical tree-decompositions of finite graphs II. Essential parts. ArXiv, arXiv:1305.4909v2 {math.CO} , 2013 . J. Carmesin, R. Diestel, M. Hamann, and F. Hundertmark. Canonical tree-decompositions of finite graphs II. Essential parts. ArXiv, arXiv:1305.4909v2 {math.CO}, 2013."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2898-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2414243"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.04.003"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.14"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.10.008"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627847"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"e_1_3_2_1_10_1","volume-title":"Computing with tangles. ArXiv, arXiv:1503.00190 {cs.DM}","author":"Grohe M.","year":"2015","unstructured":"M. Grohe and P. Schweitzer . Computing with tangles. ArXiv, arXiv:1503.00190 {cs.DM} , 2015 . Full version of this paper. M. Grohe and P. Schweitzer. Computing with tangles. ArXiv, arXiv:1503.00190 {cs.DM}, 2015. Full version of this paper."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/070685920"},{"key":"e_1_3_2_1_12_1","volume-title":"An algebraic approach to combinatorial connectivity. ArXiv, arXiv:1110.6207v1 {math.CO}","author":"Hundertmark F.","year":"2011","unstructured":"F. Hundertmark . Profiles. An algebraic approach to combinatorial connectivity. ArXiv, arXiv:1110.6207v1 {math.CO} , 2011 . F. Hundertmark. Profiles. An algebraic approach to combinatorial connectivity. ArXiv, arXiv:1110.6207v1 {math.CO}, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502096"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993697"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.03.003"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.06.006"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109646"},{"key":"e_1_3_2_1_19_1","volume-title":"Cambridge University Press","author":"Oxley J.","year":"2011","unstructured":"J. Oxley . Matroid Theory . Cambridge University Press , 2 nd edition, 2011 . J. Oxley. Matroid Theory. Cambridge University Press, 2nd edition, 2011.","edition":"2"},{"key":"e_1_3_2_1_20_1","series-title":"LMS Lecture Note Series","first-page":"87","volume-title":"Surveys in Combinatorics","author":"Reed B.","year":"1997","unstructured":"B. Reed . Tree width and tangles: A new connectivity measure and some applications . In R.A. Bailey, editor, Surveys in Combinatorics , volume 241 of LMS Lecture Note Series , pages 87 -- 162 . Cambridge University Press , 1997 . B. Reed. Tree width and tangles: A new connectivity measure and some applications. In R.A. Bailey, editor, Surveys in Combinatorics, volume 241 of LMS Lecture Note Series, pages 87--162. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90061-N"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1999.1919"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90054-P"}],"event":{"name":"STOC '15: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"STOC '15"},"container-title":["Proceedings of the forty-seventh annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2746539.2746587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:03Z","timestamp":1750272963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2746539.2746587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,14]]},"references-count":24,"alternative-id":["10.1145\/2746539.2746587","10.1145\/2746539"],"URL":"https:\/\/doi.org\/10.1145\/2746539.2746587","relation":{},"subject":[],"published":{"date-parts":[[2015,6,14]]},"assertion":[{"value":"2015-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}