{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:17:49Z","timestamp":1743020269366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030513719"},{"type":"electronic","value":"9783030513726"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51372-6_12","type":"book-chapter","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:15:38Z","timestamp":1593044138000},"page":"203-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algebras for Tree Decomposable Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7771-4154","authenticated-orcid":false,"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6204-8670","authenticated-orcid":false,"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1456-2242","authenticated-orcid":false,"given":"Matteo","family":"Sammartino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"issue":"3","key":"12_CR1","first-page":"275","volume":"2","author":"R Bellman","year":"1954","unstructured":"Bellman, R.: Some applications of the theory of dynamic programming - a review. Oper. Res. 2(3), 275\u2013288 (1954)","journal-title":"Oper. Res."},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0097-3165(73)90016-2","volume":"14","author":"U Bertel\u00e8","year":"1973","unstructured":"Bertel\u00e8, U., Brioschi, F.: On non-serial dynamic programming. J. Comb. Theory Ser. A 14(2), 137\u2013148 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jvlc.2012.10.002","volume":"24","author":"C Blume","year":"2013","unstructured":"Blume, C., Bruggink, H.J.S., Friedrich, M., K\u00f6nig, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24(3), 192\u2013206 (2013)","journal-title":"J. Vis. Lang. Comput."},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"HL Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. Comput. J. 51(3), 255\u2013269 (2008)","journal-title":"Comput. J."},{"key":"12_CR5","unstructured":"Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B.K., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of ACL 2013, Long Papers, vol. 1, pp. 924\u2013932. The Association for Computer Linguistics (2013)"},{"key":"12_CR6","volume-title":"Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"issue":"1&2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109(1&2), 49\u201382 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"12_CR8","first-page":"58","volume":"13","author":"TC Damgaard","year":"2006","unstructured":"Damgaard, T.C., Birkedal, L.: Axiomatizing binding bigraphs. Nord. J. Comput. 13(1\u20132), 58\u201377 (2006)","journal-title":"Nord. J. Comput."},{"key":"12_CR9","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Elsevier Morgan Kaufmann, Amsterdam (2003)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10990-006-8749-3","volume":"19","author":"F Gadducci","year":"2006","unstructured":"Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras, (pre)sheaves and named sets. High.-Order Symbolic Comput. 19(2), 283\u2013304 (2006)","journal-title":"High.-Order Symbolic Comput."},{"key":"12_CR11","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of UAI 2004, pp. 201\u2013208. AUAI Press (2004)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Hoch, N., Montanari, U., Sammartino, M.: Dynamic programming on nominal graphs. In: Proceedings of GaM@ETAPS 2015, EPTCS, vol. 181, pp. 80\u201396 (2015)","DOI":"10.4204\/EPTCS.181.6"},{"key":"12_CR13","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical report 580, University of Cambridge (2004)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R Milner","year":"1979","unstructured":"Milner, R.: Flowgraphs and flow algebras. J. ACM 26(4), 794\u2013818 (1979)","journal-title":"J. ACM"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"R Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16\u201335. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_2"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Montanari, U., Sammartino, M., Tcheukam Siwe, A.: Decomposition structures for soft constraint evaluation problems: an algebraic approach. In: Graph Transformation, Specifications, and Nets - In Memory of H. Ehrig, pp. 179\u2013200 (2018)","DOI":"10.1007\/978-3-319-75396-6_10"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"volume-title":"Handbook of Constraint Programming, Foundations of Artificial Intelligence","year":"2006","key":"12_CR19","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier, Amsterdam (2006)"},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations: Foundations","year":"1997","key":"12_CR20","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations: Foundations, vol. 1. World Scientific, Singapore (1997)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51372-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:55:25Z","timestamp":1710233725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51372-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030513719","9783030513726"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51372-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/av5.ljnet.it\/icgt2020\/","order":11,"name":"conference_url","label":"Conference URL","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","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":"16","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":"40% - 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":"5","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":"4 tool presentations were also accepted and included. The conference was held virtually 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}