{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T04:45:40Z","timestamp":1768625140162,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"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":["BU 1371\/2-2, BU 1371\/3-1"],"award-info":[{"award-number":["BU 1371\/2-2, BU 1371\/3-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["238381"],"award-info":[{"award-number":["238381"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448508","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Structural tractability of counting of solutions to conjunctive queries"],"prefix":"10.1145","author":[{"given":"Arnaud","family":"Durand","sequence":"first","affiliation":[{"name":"Logique Universit\u00e9 Paris Diderot Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Mengel","sequence":"additional","affiliation":[{"name":"University of Paderborn, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"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","series-title":"LNCS","first-page":"208","volume-title":"CSL'07, 16th Annual Conference of the EACSL","author":"Bagan G.","year":"2007","unstructured":"G. Bagan , A. Durand , and G. Grandjean . On Acyclic Conjunctive Queries and Constant Delay Enumeration . In CSL'07, 16th Annual Conference of the EACSL , volume 4646 of LNCS , pages 208 -- 222 . Springer , 2007 . G. Bagan, A. Durand, and G. Grandjean. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In CSL'07, 16th Annual Conference of the EACSL, volume 4646 of LNCS, pages 208--222. Springer, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167161"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.09.006"},{"key":"e_1_3_2_1_5_1","volume-title":"June","author":"Chen H.","year":"2012","unstructured":"H. Chen . On the Complexity of Existential Positive Queries. ArXiv e-prints , June 2012 . H. Chen. On the Complexity of Existential Positive Queries. ArXiv e-prints, June 2012."},{"key":"e_1_3_2_1_6_1","first-page":"167","volume-title":"Beyond Hypertree Width: Decomposition Methods Without Decompositions. In 11th International Conference Principles and Practice of Constraint Programming, CP '05","author":"Chen H.","year":"2005","unstructured":"H. Chen and V. Dalmau . Beyond Hypertree Width: Decomposition Methods Without Decompositions. In 11th International Conference Principles and Practice of Constraint Programming, CP '05 , pages 167 -- 181 , 2005 . H. Chen and V. Dalmau. Beyond Hypertree Width: Decomposition Methods Without Decompositions. In 11th International Conference Principles and Practice of Constraint Programming, CP '05, pages 167--181, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.31"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.008"},{"key":"e_1_3_2_1_10_1","volume-title":"The Complexity of Weighted Counting for Acyclic Conjunctive Queries. Arxiv preprint arXiv:1110.4201","author":"Durand A.","year":"2011","unstructured":"A. Durand and S. Mengel . The Complexity of Weighted Counting for Acyclic Conjunctive Queries. Arxiv preprint arXiv:1110.4201 , 2011 . A. Durand and S. Mengel. The Complexity of Weighted Counting for Acyclic Conjunctive Queries. Arxiv preprint arXiv:1110.4201, 2011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_3_2_1_12_1","volume-title":"Parameterized Complexity Theory","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parameterized Complexity Theory . Springer-Verlag New York Inc ., 2006 . J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag New York Inc., 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00078-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886008.1886032"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206036"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109590"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380867"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90003-5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721845"},{"key":"e_1_3_2_1_24_1","volume-title":"AMW","author":"Pichler R.","year":"2011","unstructured":"R. Pichler and A. Skritek . Tractable Counting of the Answers to Conjunctive Queries . In AMW , 2011 . R. Pichler and A. Skritek. Tractable Counting of the Answers to Conjunctive Queries. In AMW, 2011."},{"key":"e_1_3_2_1_25_1","first-page":"82","volume-title":"VLDB","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for Acyclic Database Schemes . In VLDB , pages 82 -- 94 , 1981 . M. Yannakakis. Algorithms for Acyclic Database Schemes. In VLDB, pages 82--94, 1981."}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","location":"Genoa Italy","acronym":"EDBT\/ICDT '13"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":24,"alternative-id":["10.1145\/2448496.2448508","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448508","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}