{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:08Z","timestamp":1750309088799,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T00:00:00Z","timestamp":1269302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["(C)21500104"],"award-info":[{"award-number":["(C)21500104"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,3,23]]},"DOI":"10.1145\/1804669.1804692","type":"proceedings-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T13:46:25Z","timestamp":1274190385000},"page":"174-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A greedy algorithm for constructing a low-width generalized hypertree decomposition"],"prefix":"10.1145","author":[{"given":"Kaoru","family":"Katayama","sequence":"first","affiliation":[{"name":"Tokyo Metropolitan University, Hino, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuro","family":"Okawara","sequence":"additional","affiliation":[{"name":"Tokyo Metropolitan University, Hino, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuka","family":"Ito","sequence":"additional","affiliation":[{"name":"Rakuten, Inc., Shinagawa, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,3,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.04.013"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88636-5_1"},{"key":"e_1_3_2_1_3_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2000","unstructured":"R. Diestel . Graph Theory Second Edition. Springer , 2000 . R. Diestel. Graph Theory Second Edition. Springer, 2000."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1624218.1624275"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303979"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/648312.755356"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375579"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412229"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/951951.952258"},{"key":"e_1_3_2_1_12_1","volume-title":"Algorithm Design","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg and E. Tardos . Algorithm Design . Addison Wesley , 2006 . J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2006."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the third ACiD Workshop","volume":"9","author":"Mikl\u00f3s Z.","year":"2007","unstructured":"Z. Mikl\u00f3s . On the parallel complexity of structural CSP decomposition methods. In H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, editors, Algorithms and Complexity in Durham 2007 , Proceedings of the third ACiD Workshop , volume 9 of Texts in Algorithmics, pages 107--118. College Publications London , 2007 . Z. Mikl\u00f3s. On the parallel complexity of structural CSP decomposition methods. In H. Broersma, S. Dantchev, M. Johnson, and S. Szeider, editors, Algorithms and Complexity in Durham 2007, Proceedings of the third ACiD Workshop, volume 9 of Texts in Algorithmics, pages 107--118. College Publications London, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.010"}],"event":{"name":"EDBT\/ICDT '10: EDBT\/ICDT '10 joint conference","acronym":"EDBT\/ICDT '10","location":"Lausanne Switzerland"},"container-title":["Proceedings of the 13th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1804669.1804692","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1804669.1804692","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:36Z","timestamp":1750286616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1804669.1804692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,23]]},"references-count":14,"alternative-id":["10.1145\/1804669.1804692","10.1145\/1804669"],"URL":"https:\/\/doi.org\/10.1145\/1804669.1804692","relation":{},"subject":[],"published":{"date-parts":[[2010,3,23]]},"assertion":[{"value":"2010-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}