{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:33Z","timestamp":1781077773152,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":73,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Simons Foundation"},{"DOI":"10.13039\/100000893","name":"UMass Amherst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451043","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"342-355","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Clan embeddings into trees, and low treewidth graphs"],"prefix":"10.1145","author":[{"given":"Arnold","family":"Filtser","sequence":"first","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hung","family":"Le","sequence":"additional","affiliation":[{"name":"University of Massachusetts, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371039"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188808"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1112406"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1115575"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003730200002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224474"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24598-8_27"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405013"},{"key":"e_1_3_2_1_12_1","volume-title":"An entropy based proof of the Moore bound for irregular graphs. CoRR, abs\/1011.1058","author":"Babu Ajesh","year":"2010","unstructured":"Ajesh Babu and Jaikumar Radhakrishnan. 2010. An entropy based proof of the Moore bound for irregular graphs. CoRR, abs\/1011.1058, 2010. arxiv:1011.1058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_10"},{"key":"e_1_3_2_1_17_1","unstructured":"Yair Bartal. 2011. Lecture notes in Metric Embedding Theory and Its Algorithmic Applications. http:\/\/moodle.cs.huji.ac.il\/cs10\/file.php\/67720\/GM_Lecture6.pdf"},{"key":"e_1_3_2_1_18_1","volume-title":"Advances in Metric Ramsey Theory and its Applications. CoRR, abs\/2104.03484","author":"Bartal Yair","year":"2021","unstructured":"Yair Bartal. 2021. Advances in Metric Ramsey Theory and its Applications. CoRR, abs\/2104.03484, 2021. arxiv:2104.03484"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.20"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024610704006155"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1100-z"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433122"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-109-8"},{"key":"e_1_3_2_1_25_1","volume-title":"A New Efficient Construction on Probabilistic Tree Embeddings. CoRR, abs\/1605.04651","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch, Yan Gu, and Yihan Sun. 2016. A New Efficient Construction on Probabilistic Tree Embeddings. CoRR, abs\/1605.04651, 2016. arxiv:1605.04651"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.IPEC.2016.8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.76"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02801990"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188798"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_15"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.79"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749396"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484268"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746562"},{"key":"e_1_3_2_1_36_1","volume-title":"Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR, abs\/2009.05039","author":"Cohen-Addad Vincent","year":"2020","unstructured":"Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, and Hung Le. 2020. On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR, abs\/2009.05039, 2020. arxiv:2009.05039"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M112717X"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1134"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077468"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.14"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00002-6"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.47"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641661"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274651"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48749-6_20"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.011"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1067196"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.6"},{"key":"e_1_3_2_1_49_1","unstructured":"A. Filtser and H. Le. 2021. Clan Embeddings into Trees and Low Treewidth Graphs. CoRR abs\/2101.01146 2021. arxiv:2101.01146"},{"key":"e_1_3_2_1_50_1","volume-title":"Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR, abs\/2101.07428","author":"Filtser Arnold","year":"2021","unstructured":"Arnold Filtser and Hung Le. 2021. Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR, abs\/2101.07428, 2021. arxiv:2101.07428"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.66"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713820"},{"key":"e_1_3_2_1_53_1","volume-title":"Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR, abs\/2102.05168","author":"Haeupler Bernhard","year":"2021","unstructured":"Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic. 2021. Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR, abs\/2102.05168, 2021. arxiv:2102.05168"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959878"},{"key":"e_1_3_2_1_56_1","volume-title":"August, 5","author":"Karp Richard M","year":"1989","unstructured":"Richard M Karp. 1989. A 2k-competitive algorithm for the circle. Manuscript, August, 5, 1989."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.11.002"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.03.052"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0157-9"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-005-0527-6"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1995-00569-0"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-02-06605-4"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_72"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-012-0039-7"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/65950.65953"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009336"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/304893.304983"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90097-4"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451043","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":73,"alternative-id":["10.1145\/3406325.3451043","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451043","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}