{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:05:30Z","timestamp":1743051930845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_13","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"152-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Amalgamation Under Logical Constraints"],"prefix":"10.1007","author":[{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"13_CR1","unstructured":"Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proceedings of SODA 2008, pp. 641\u2013650. SIAM (2008)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Pilipczuk, M.: Definability equals recognizability for graphs of bounded treewidth. In Procedings of LICS 2016, pp. 407\u2013416. ACM (2016)","DOI":"10.1145\/2933575.2934508"},{"key":"13_CR3","unstructured":"Comon, H., et al.: Tree Automata Techniques and Applications (2007)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(99)00305-9","volume":"237","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B.: The monadic second-order logic of graphs xii: planar graphs and planar maps. Theor. Comput. Sci. 237(1), 1\u201332 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"13_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00180-8","volume":"244","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B.: The monadic second-order logic of graphs xiii: graph drawings with edge crossings. Theor. Comput. Sci. 244(1\u20132), 63\u201394 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, vol. 138. Cambridge University Press, Cambridge (2012)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B Courcelle","year":"2007","unstructured":"Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Combina. Theory, Ser. B 97(1), 91\u2013126 (2007)","journal-title":"J. Combina. Theory, Ser. B"},{"key":"13_CR9","unstructured":"de Oliveira Oliveira, M.: On supergraphs satisfying CMSO properties. In: Proceedings of the 26th Annual Conference on Computer Science Logic (CSL 2017). LIPIcs, vol. 82, pp. 33:1\u201333:15 (2017)"},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and h-minor-free graphs. J. ACM (JACM) 52(6), 866\u2013893 (2005)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/jgt.3190110108","volume":"11","author":"R Diestel","year":"1987","unstructured":"Diestel, R.: A separation property of planar triangulations. J. Graph Theory 11(1), 43\u201352 (1987)","journal-title":"J. Graph Theory"},{"key":"13_CR12","unstructured":"Elberfeld, M.: Context-free graph properties via definable decompositions. In: Proceedings of the 25th Conference on Computer Science Logic (CSL 2016). LIPIcs, vol. 62, pp. 17:1\u201317:16 (2016)"},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM (JACM) 49(6), 716\u2013752 (2002)","journal-title":"J. ACM (JACM)"},{"key":"13_CR14","first-page":"19","volume":"49","author":"JL Gross","year":"2011","unstructured":"Gross, J.L.: Genus distribution of graph amalgamations: self-pasting at root-vertices. Australas. J. Combin. 49, 19\u201338 (2011)","journal-title":"Australas. J. Combin."},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0095-8956(03)00030-3","volume":"88","author":"AJ Hilton","year":"2003","unstructured":"Hilton, A.J., Johnson, M., Rodger, C.A., Wantland, E.B.: Amalgamations of connected k-factorizations. J. Combin. Theory, Ser. B 88(2), 267\u2013279 (2003)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"1\u20133","key":"13_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0012-365X(95)00107-8","volume":"159","author":"CR Johnson","year":"1996","unstructured":"Johnson, C.R., McKee, T.A.: Structural conditions for cycle completable graphs. Discret. Math. 159(1\u20133), 155\u2013160 (1996)","journal-title":"Discret. Math."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0012-365X(90)90150-G","volume":"81","author":"I Kriz","year":"1990","unstructured":"Kriz, I., Thomas, R.: Clique-sums, tree-decompositions and compactness. Discret. Math. 81(2), 177\u2013185 (1990)","journal-title":"Discret. Math."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1002\/jgt.10142","volume":"44","author":"CD Leach","year":"2003","unstructured":"Leach, C.D., Rodger, C.: Hamilton decompositions of complete multipartite graphs with any 2-factor leave. J. Graph Theory 44(3), 208\u2013214 (2003)","journal-title":"J. Graph Theory"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Graph minor theory. Bull. Am. Math. Soc. 43(1), 75\u201386 (2006)","journal-title":"Bull. Am. Math. Soc."},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.dam.2004.01.016","volume":"145","author":"JA Makowsky","year":"2005","unstructured":"Makowsky, J.A.: Coloured tutte polynomials and Kauffman brackets for graphs of bounded tree width. Discret. Appl. Math. 145(2), 276\u2013290 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20132","key":"13_CR21","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0196-8858(02)00530-4","volume":"30","author":"JA Makowsky","year":"2003","unstructured":"Makowsky, J.A., Marino, J.P.: Farrell polynomials on graphs of bounded tree width. Adv. Appl. Math. 30(1\u20132), 160\u2013176 (2003)","journal-title":"Adv. Appl. Math."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11917496_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"JA Makowsky","year":"2006","unstructured":"Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing graph polynomials on graphs of bounded clique-width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 191\u2013204. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11917496_18"},{"key":"13_CR23","unstructured":"Marx, D., Pilipczuk, M.: Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), pp. 542 (2014)"},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding ISO-and other morphisms for partial k-trees. Discret. Math. 108(1), 343\u2013364 (1992)","journal-title":"Discret. Math."},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1111\/j.1749-6632.1979.tb32819.x","volume":"319","author":"J Ne\u0161et\u0159il","year":"1979","unstructured":"Ne\u0161et\u0159il, J.: Amalgamation of graphs and its applications. Ann. New York Acad. Sci. 319(1), 415\u2013428 (1979)","journal-title":"Ann. New York Acad. Sci."},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory, Ser. B 89(1), 43\u201376 (2003)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"2","key":"13_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/jgt.3190080206","volume":"8","author":"PD Seymour","year":"1984","unstructured":"Seymour, P.D., Weaver, R.: A generalization of chordal graphs. J. Graph Theory 8(2), 241\u2013251 (1984)","journal-title":"J. Graph Theory"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"561","DOI":"10.7151\/dmgt.1942","volume":"37","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Chen, Y.: The thickness of amalgamations and cartesian product of graphs. Discuss. Math. Graph Theory 37(3), 561\u2013572 (2017)","journal-title":"Discuss. Math. Graph Theory"}],"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-00256-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:04Z","timestamp":1710336304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","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":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"45% - 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":"4","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,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)"}}]}}