{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:15:03Z","timestamp":1778807703803,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":41,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448498","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"10-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Enumerating with constant delay the answers to a query"],"prefix":"10.1145","author":[{"given":"Luc","family":"Segoufin","sequence":"first","affiliation":[{"name":"INRIA and ENS Cachan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu . Foundations of Databases . Addison Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995."},{"key":"e_1_3_2_1_2_1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974","unstructured":"A. V. Aho , J. E. Hopcroft , and J. D. Ullman . The Design and Analysis of Computer Algorithms . Addison-Wesley , 1974 . A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887459.1887471"},{"key":"e_1_3_2_1_7_1","first-page":"208","volume-title":"On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Conf. on Computer Science Logic (CSL)","author":"Bagan G.","year":"2007","unstructured":"G. Bagan , A. Durand , and E. Grandjean . On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Conf. on Computer Science Logic (CSL) , pages 208 -- 222 , 2007 . G. Bagan, A. Durand, and E. Grandjean. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Conf. on Computer Science Logic (CSL), pages 208--222, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2007046"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516515"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989731"},{"key":"e_1_3_2_1_11_1","unstructured":"J. Brault-Baron. Personal communication.  J. Brault-Baron. Personal communication."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1007\/978-3-540-73420-8_77","volume-title":"Coll. on Automata, Languages and Programming (ICALP)","author":"Colcombet T.","year":"2007","unstructured":"T. Colcombet . A Combinatorial Theorem for Trees . In Intl . Coll. on Automata, Languages and Programming (ICALP) , pages 901 -- 912 , 2007 . T. Colcombet. A Combinatorial Theorem for Trees. In Intl. Coll. on Automata, Languages and Programming (ICALP), pages 901--912, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_14_1","volume-title":"Handbook of Theoretical Computer Science","author":"Courcelle B.","year":"1990","unstructured":"B. Courcelle . Graph Rewriting : An Algebraic and Logic Approach . In Handbook of Theoretical Computer Science , Volume B: Formal Models and Sematics (B), pages 193-- 242 . 1990 . B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 193--242. 1990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.08.021"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2023474.2023489"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.31"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276920.1276923"},{"key":"e_1_3_2_1_19_1","volume-title":"On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems. CoRR, abs\/1110.4201","author":"Durand A.","year":"2011","unstructured":"A. Durand and S. Mengel . On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems. CoRR, abs\/1110.4201 , 2011 . A. Durand and S. Mengel. On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems. CoRR, abs\/1110.4201, 2011."},{"key":"e_1_3_2_1_20_1","first-page":"189","volume-title":"Enumeration Complexity of Logical Query Problems with Second-order Variables. In Conf. on Computer Science Logic (CSL)","author":"Durand A.","year":"2011","unstructured":"A. Durand and Y. Strozecki . Enumeration Complexity of Logical Query Problems with Second-order Variables. In Conf. on Computer Science Logic (CSL) , pages 189 -- 202 , 2011 . A. Durand and Y. Strozecki. Enumeration Complexity of Logical Query Problems with Second-order Variables. In Conf. on Computer Science Logic (CSL), pages 189--202, 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.20"},{"key":"e_1_3_2_1_22_1","volume-title":"Testing first-order properties for subclasses of sparse graphs. CoRR, abs\/1109.5036","author":"Dvorak Z.","year":"2011","unstructured":"Z. Dvorak , D. Kr\u00e1l , and R. Thomas . Testing first-order properties for subclasses of sparse graphs. CoRR, abs\/1109.5036 , 2011 . Z. Dvorak, D. Kr\u00e1l, and R. Thomas. Testing first-order properties for subclasses of sparse graphs. CoRR, abs\/1109.5036, 2011."},{"key":"e_1_3_2_1_23_1","volume-title":"Parameterized Complexity Theory","author":"Flum J.","year":"2006","unstructured":"J. Flum and M. Grohe . Parameterized Complexity Theory . Springer , 2006 . J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504798"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.01.007"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127798"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/558","volume-title":"Model Theoretic Methods in Finite Combinatorics","author":"Grohe M.","year":"2011","unstructured":"M. Grohe and S. Kreutzer . Model Theoretic Methods in Finite Combinatorics , chapter Methods for Algorithmic Meta Theorems. American Mathematical Society , 2011 . M. Grohe and S. Kreutzer. Model Theoretic Methods in Finite Combinatorics, chapter Methods for Algorithmic Meta Theorems. American Mathematical Society, 2011."},{"key":"e_1_3_2_1_28_1","unstructured":"W. Kazana and L. Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. Manuscript.  W. Kazana and L. Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. Manuscript ."},{"key":"e_1_3_2_1_29_1","volume-title":"First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science (LMCS), 7(2)","author":"Kazana W.","year":"2011","unstructured":"W. Kazana and L. Segoufin . First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science (LMCS), 7(2) , 2011 . W. Kazana and L. Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science (LMCS), 7(2), 2011."},{"key":"e_1_3_2_1_30_1","unstructured":"W. Kazana and L. Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. on Computational Logic (ToCL) to appear.  W. Kazana and L. Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. on Computational Logic (ToCL) to appear."},{"key":"e_1_3_2_1_31_1","volume-title":"Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131","author":"Kreutzer S.","year":"2009","unstructured":"S. Kreutzer and A. Dawar . Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131 , 2009 . S. Kreutzer and A. Dawar. Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131, 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108005632"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.07.013"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.01.006"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity. Springer","author":"Ne\u0161et\u0159il J.","year":"2012","unstructured":"J. Ne\u0161et\u0159il and P. Ossona de Mendez . Sparsity. Springer , 2012 . J. Ne\u0161et\u0159il and P. Ossona de Mendez. Sparsity. Springer, 2012."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1626"},{"key":"e_1_3_2_1_37_1","volume-title":"Alberto Mendelzon Intl. Workshop on Foundations of Data Management (AMW)","author":"Pichler R.","year":"2011","unstructured":"R. Pichler and S. Skritek . Tractable Counting of the Answers to Conjunctive Queries . In Alberto Mendelzon Intl. Workshop on Foundations of Data Management (AMW) , 2011 . R. Pichler and S. Skritek. Tractable Counting of the Answers to Conjunctive Queries. In Alberto Mendelzon Intl. Workshop on Foundations of Data Management (AMW), 2011."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500070079"},{"key":"e_1_3_2_1_39_1","first-page":"7","article-title":"Enumeration complexity and matroid decomposition. PhD thesis","author":"Strozecki Y.","year":"2010","unstructured":"Y. Strozecki . Enumeration complexity and matroid decomposition. PhD thesis , Universit\u00e9 de Paris 7 , 2010 . Y. Strozecki. Enumeration complexity and matroid decomposition. PhD thesis, Universit\u00e9 de Paris 7, 2010.","journal-title":"Universit\u00e9 de Paris"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885577.1885632"},{"key":"e_1_3_2_1_41_1","first-page":"92","volume-title":"Maximum and Maximal Matchings in Bipartite Graphs. In Intl. Symp. on Algorithms and Computation","author":"Uno T.","year":"1997","unstructured":"T. Uno . Algorithms for Enumerating All Perfect , Maximum and Maximal Matchings in Bipartite Graphs. In Intl. Symp. on Algorithms and Computation , pages 92 -- 101 , 1997 . T. Uno. Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. In Intl. Symp. on Algorithms and Computation, pages 92--101, 1997."},{"key":"e_1_3_2_1_42_1","first-page":"82","volume-title":"Algorithms for Acyclic Database Schemes. In Intl. Conf. on Very Large Databases (VLDB)","author":"Yannakakis M.","year":"1981","unstructured":"M. Yannakakis . Algorithms for Acyclic Database Schemes. In Intl. Conf. on Very Large Databases (VLDB) , pages 82 -- 94 , 1981 . M. Yannakakis. Algorithms for Acyclic Database Schemes. In Intl. Conf. on Very Large Databases (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.2448498","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448498","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.2448498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":41,"alternative-id":["10.1145\/2448496.2448498","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448498","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"}}]}}