{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:54:08Z","timestamp":1782161648099,"version":"3.54.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032299208","type":"print"},{"value":"9783032299215","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29921-5_24","type":"book-chapter","created":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:20:24Z","timestamp":1782159624000},"page":"350-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph-Based Modeling of\u00a0Alignment Relations and\u00a0Pattern Detection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3059-9953","authenticated-orcid":false,"given":"Rita-Nathalia","family":"Assaf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8636-3870","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8227-7174","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,23]]},"reference":[{"key":"24_CR1","unstructured":"Bessiere, C., Zanuttini, B., Fern\u00e0ndez, C.: Measuring search trees. In: Workshop on Modelling and Solving Problems with Constraints - ECAI 2004, Valencia, Spain, pp. 31\u201340 (2004)"},{"key":"24_CR2","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"24_CR3","unstructured":"Huang, B., et al.: Geographical Information Systems (2017)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-50349-3_8","volume-title":"Learning and Intelligent Optimization","author":"L Kotthoff","year":"2016","unstructured":"Kotthoff, L., McCreesh, C., Solnon, C.: Portfolios of subgraph isomorphism algorithms. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) LION 2016. LNCS, vol. 10079, pp. 107\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_8"},{"key":"24_CR5","unstructured":"Lecoutre, C., Szczepanski, N.: PyCSP3: modeling combinatorial constrained problems in Python (2024)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1613\/jair.5768","volume":"61","author":"C McCreesh","year":"2018","unstructured":"McCreesh, C., Prosser, P., Solnon, C., Trimble, J.: When subgraph isomorphism is really hard, and why this matters for graph databases. J. Artif. Intell. Res. 61, 723\u2013759 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-030-51372-6_19","volume-title":"Graph Transformation","author":"C McCreesh","year":"2020","unstructured":"McCreesh, C., Prosser, P., Trimble, J.: The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 316\u2013324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_19"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Nikolaou, C., Koubarakis, M.: Fast consistency checking of very large real-world RCC-8 constraint networks using graph partitioning. Proc. Nat. Conf. Artif. Intell. 4, 2724\u20132730 (2014)","DOI":"10.1609\/aaai.v28i1.9115"},{"key":"24_CR9","unstructured":"Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: Principles of Knowledge Representation and Reasoning, KR, pp. 165\u2013176 (1992)"},{"key":"24_CR10","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth, B., Korf, R.E. (eds.) Proceedings of the 12th National Conference on Artificial Intelligence, vol. 1, pp. 362\u2013367 (1994)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"19872","DOI":"10.1109\/ACCESS.2024.3360528","volume":"12","author":"T Saout","year":"2024","unstructured":"Saout, T., Lardeux, F., Saubion, F.: An overview of data extraction from invoices. IEEE Access 12, 19872\u201319886 (2024)","journal-title":"IEEE Access"},{"key":"24_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2025.104474","volume":"352","author":"C Solnon","year":"2026","unstructured":"Solnon, C.: LAD 2025, a constraint-based solver for the subgraph isomorphism problem. Artif. Intell. 352, 104474 (2026)","journal-title":"Artif. Intell."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"24_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104219","volume":"337","author":"Y Wang","year":"2024","unstructured":"Wang, Y., Jin, C., Cai, S.: PathLAD+: towards effective exact methods for subgraph isomorphism problem. Artif. Intell. 337, 104219 (2024)","journal-title":"Artif. Intell."},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10601-009-9074-3","volume":"15","author":"S Zampelli","year":"2010","unstructured":"Zampelli, S., Deville, Y., Solnon, C.: Solving subgraph isomorphism problems with constraint programming. Constraints 15(3), 327\u2013353 (2010)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29921-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:20:28Z","timestamp":1782159628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29921-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032299208","9783032299215"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29921-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}