{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089794,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"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-79987-8_27","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"385-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isomorphic Unordered Labeled Trees up\u00a0to Substitution Ciphering"],"prefix":"10.1007","author":[{"given":"Florian","family":"Ingels","sequence":"first","affiliation":[]},{"given":"Romain","family":"Aza\u00efs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"27_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading (1974)"},{"issue":"38","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.21105\/joss.01351","volume":"4","author":"R Aza\u00efs","year":"2019","unstructured":"Aza\u00efs, R., Cerutti, G., Gemmerl\u00e9, D., Ingels, F.: Treex: a Python package for manipulating rooted trees. J. Open Source Softw. 4(38), 1351 (2019)","journal-title":"J. Open Source Softw."},{"key":"27_CR3","first-page":"1","volume":"21","author":"R Aza\u00efs","year":"2020","unstructured":"Aza\u00efs, R., Ingels, F.: The weight function in the subtree kernel is decisive. J. Mach. Learn. Res. 21, 1\u201336 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"27_CR4","unstructured":"Booth, K.S., Colbourn, C.J.: Problems polynomially equivalent to graph isomorphism. University, Computer Science Department (1979)"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s00453-013-9785-0","volume":"71","author":"S Canzar","year":"2015","unstructured":"Canzar, S., Elbassioni, K., Klau, G.W., Mestre, J.: On tree-constrained matchings and generalizations. Algorithmica 71(1), 98\u2013119 (2015)","journal-title":"Algorithmica"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45006-8_9","volume-title":"Case-Based Reasoning Research and Development","author":"P-A Champin","year":"2003","unstructured":"Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS (LNAI), vol. 2689, pp. 80\u201395. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45006-8_9"},{"key":"27_CR7","unstructured":"Gardner, M.: Codes, Ciphers and Secret Writing. Courier Corporation (1984)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweitzer, P., Wiebking, D.: Deep Weisfeiler Leman. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2600\u20132614. SIAM (2021)","DOI":"10.1137\/1.9781611976465.154"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-32147-4_31","volume-title":"Combinatorial Optimization","author":"M Mastrolilli","year":"2012","unstructured":"Mastrolilli, M., Stamoulis, G.: Constrained matching problems in bipartite graphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 344\u2013355. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32147-4_31"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/BFb0039599","volume-title":"STACS 87","author":"U Sch\u00f6ning","year":"1987","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 114\u2013124. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0039599"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Valiente, G.: Algorithms on Trees and Graphs. Springer Science & Business Media, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04921-1","DOI":"10.1007\/978-3-662-04921-1"},{"issue":"9","key":"27_CR12","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Leman, A.: The reduction of a graph to canonical form and the algebra which appears therein. NTI Ser. 2(9), 12\u201316 (1968)","journal-title":"NTI Ser."},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1007\/BF02104746","volume":"29","author":"VN Zemlyachenko","year":"1985","unstructured":"Zemlyachenko, V.N., Korneenko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. J. Sov. Math. 29(4), 1426\u20131481 (1985)","journal-title":"J. Sov. Math."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1214\/14-BJPS252","volume":"29","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Zhang, Y.: On the number of leaves in a random recursive tree. Braz. J. Probab. Stat. 29, 897\u2013908 (2015)","journal-title":"Braz. J. Probab. Stat."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:13:45Z","timestamp":1625008425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_27","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":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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 workshop was held virtually.","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)"}}]}}