{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:17:06Z","timestamp":1743038226709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_18","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"232-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Dynamic Complexity of Acyclic Hypergraph Homomorphisms"],"prefix":"10.1007","author":[{"given":"Nils","family":"Vortmeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Kokkinis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM (JACM) 30(3), 479\u2013513 (1983). https:\/\/doi.org\/10.1145\/2402.322389","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1137\/0210059","volume":"10","author":"PA Bernstein","year":"1981","unstructured":"Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM J. Comput. 10(4), 751\u2013771 (1981). https:\/\/doi.org\/10.1137\/0210059","journal-title":"SIAM J. Comput."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-57899-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: Dynamic algorithms for graphs with treewidth 2. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 112\u2013124. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57899-4_45"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Hopcroft, J.E., Friedman, E.P., Harrison, M.A. (eds.) Proceedings of the 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, USA, 4\u20136 May 1977, pp. 77\u201390. ACM (1977). https:\/\/doi.org\/10.1145\/800105.803397","DOI":"10.1145\/800105.803397"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-46135-3_21","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"V Dalmau","year":"2002","unstructured":"Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310\u2013326. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_21"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Datta, S., Kulkarni, R., Mukherjee, A., Schwentick, T., Zeume, T.: Reachability is in DynFO. J. ACM 65(5), 33:1\u201333:24 (2018). https:\/\/doi.org\/10.1145\/3212685","DOI":"10.1145\/3212685"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Datta, S., Mukherjee, A., Schwentick, T., Vortmeier, N., Zeume, T.: A strategy for dynamic programs: start over and muddle through. Log. Methods Comput. Sci. 15(2) (2019). https:\/\/doi.org\/10.23638\/LMCS-15(2:12)2019","DOI":"10.23638\/LMCS-15(2:12)2019"},{"issue":"2\u20134","key":"18_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01530820","volume":"14","author":"G Dong","year":"1995","unstructured":"Dong, G., Su, J., Topor, R.W.: Nonrecursive incremental evaluation of datalog queries. Ann. Math. Artif. Intell. 14(2\u20134), 187\u2013223 (1995). https:\/\/doi.org\/10.1007\/BF01530820","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM (JACM) 30(3), 514\u2013550 (1983). https:\/\/doi.org\/10.1145\/2402.322390","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28(1), 57\u2013104 (1998). https:\/\/doi.org\/10.1137\/S0097539794266766","journal-title":"SIAM J. Comput."},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3), 19:1\u201319:36 (2012). https:\/\/doi.org\/10.1145\/2287718.2287719","DOI":"10.1145\/2287718.2287719"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"48","author":"G Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM 48(3), 431\u2013498 (2001). https:\/\/doi.org\/10.1145\/382780.382783","journal-title":"J. ACM"},{"issue":"12","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.14778\/2824032.2824075","volume":"8","author":"TJ Green","year":"2015","unstructured":"Green, T.J., Olteanu, D., Washburn, G.: Live programming in the LogicBlox system: a MetaLogiQL approach. Proc. VLDB Endow. 8(12), 1782\u20131791 (2015). https:\/\/doi.org\/10.14778\/2824032.2824075","journal-title":"Proc. VLDB Endow."},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1), 1:1\u20131:24 (2007). https:\/\/doi.org\/10.1145\/1206035.1206036","DOI":"10.1145\/1206035.1206036"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, A., Mumick, I.S.: Maintenance of Materialized Views: Problems, Techniques, and Applications, pp. 145\u2013157. MIT Press, Cambridge (1999)","DOI":"10.7551\/mitpress\/4472.003.0016"},{"issue":"1","key":"18_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Nesetril, J.: On the complexity of H-coloring. J. Comb. Theory Ser. B 48(1), 92\u2013110 (1990). https:\/\/doi.org\/10.1016\/0095-8956(90)90132-J","journal-title":"J. Comb. Theory Ser. B"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Koch, C.: Incremental query evaluation in a ring of databases. In: Paredaens, J., Gucht, D.V. (eds.) Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, Indianapolis, Indiana, USA, 6\u201311 June 2010, pp. 87\u201398. ACM (2010). https:\/\/doi.org\/10.1145\/1807085.1807100","DOI":"10.1145\/1807085.1807100"},{"key":"18_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, P., Vortmeier, N., Zeume, T.: Dynamic graph queries. In: Martens, W., Zeume, T. (eds.) 19th International Conference on Database Theory (ICDT 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 48, pp. 14:1\u201314:18. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2016.14","DOI":"10.4230\/LIPIcs.ICDT.2016.14"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: a parallel, dynamic complexity class. J. Comput. Syst. Sci. 55(2), 199\u2013209 (1997). https:\/\/doi.org\/10.1006\/jcss.1997.1520","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3442322.3442325","volume":"49","author":"T Schwentick","year":"2020","unstructured":"Schwentick, T., Vortmeier, N., Zeume, T.: Sketches of dynamic complexity. SIGMOD Rec. 49(2), 18\u201329 (2020). https:\/\/doi.org\/10.1145\/3442322.3442325","journal-title":"SIGMOD Rec."},{"issue":"2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","volume":"43","author":"H Venkateswaran","year":"1991","unstructured":"Venkateswaran, H.: Properties that characterize LOGCFL. J. Comput. Syst. Sci. 43(2), 380\u2013404 (1991). https:\/\/doi.org\/10.1016\/0022-0000(91)90020-6","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR23","unstructured":"Vortmeier, N., Kokkinis, I.: The dynamic complexity of acyclic hypergraph homomorphisms. CoRR abs\/2107.06121 (2021). https:\/\/arxiv.org\/abs\/2107.06121"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Vortmeier, N., Zeume, T.: Dynamic complexity of parity exists queries. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic, CSL 2020. LIPIcs, Barcelona, Spain, 13\u201316 January 2020, vol. 152, pp. 37:1\u201337:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.37","DOI":"10.4230\/LIPIcs.CSL.2020.37"},{"key":"18_CR25","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of the 7th International Conference on Very Large Data Bases, Cannes, France, 9\u201311 September 1981, pp. 82\u201394. IEEE Computer Society (1981). https:\/\/dl.acm.org\/doi\/10.5555\/1286831.1286840"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ic.2017.04.005","volume":"256","author":"T Zeume","year":"2017","unstructured":"Zeume, T.: The dynamic descriptive complexity of k-clique. Inf. Comput. 256, 9\u201322 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.04.005","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:40Z","timestamp":1702065760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}