{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:58Z","timestamp":1773762658797,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031159138","type":"print"},{"value":"9783031159145","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_3","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"29-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Testing Isomorphism of\u00a0Chordal Graphs of\u00a0Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[]},{"given":"Roman","family":"Nedela","sequence":"additional","affiliation":[]},{"given":"Ilia","family":"Ponomarenko","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Zeman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Agaoglu, D., Hlinen\u00fd, P.: Isomorphism problem for $$S_d$$-graphs. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, 24\u201328 August 2020. LIPIcs, vol. 170, pp. 4:1\u20134:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.4","DOI":"10.4230\/LIPIcs.MFCS.2020.4"},{"key":"3_CR2","unstructured":"Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (2021). https:\/\/arxiv.org\/abs\/2107.10689"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Arvind, V., Das, B., K\u00f6bler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. Algorithmica 71(1), 120\u2013138 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9787-y","DOI":"10.1007\/s00453-013-9787-y"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 684\u2013697. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897542","DOI":"10.1145\/2897518.2897542"},{"issue":"1\u20133","key":"3_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M Biro","year":"1992","unstructured":"Biro, M., Hujter, M., Tuza, Z.: Precoloring extension I. Interval graphs. Discret. Math. 100(1\u20133), 267\u2013279 (1992)","journal-title":"Discret. Math."},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Brand, N.: Isomorphisms of cyclic combinatorial objects. Discret. Math. 78(1-2), 73\u201381 (1989). https:\/\/doi.org\/10.1016\/0012-365X(89)90162-3","DOI":"10.1016\/0012-365X(89)90162-3"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-96731-4_20","volume-title":"WALCOM: Algorithms and Computation","author":"DA \u00c7agirici","year":"2022","unstructured":"\u00c7agirici, D.A., Hlinen\u00fd, P.: Isomorphism testing for T-graphs in FPT. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM 2022. LNCS, vol. 13174, pp. 239\u2013250. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-96731-4_20"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-68705-6_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., T\u00f6pfer, M., Voborn\u00edk, J., Zeman, P.: On H-topological intersection graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 167\u2013179. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_13"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Zeman, P.: Combinatorial problems on H-graphs. Electron. Notes Discret. Math. 61, 223\u2013229 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.06.042","DOI":"10.1016\/j.endm.2017.06.042"},{"key":"3_CR10","unstructured":"Chaplick, S., Zeman, P.: Isomorphism-completeness for H-graphs (2021). https:\/\/kam.mff.cuni.cz\/pizet\/gic.pdf"},{"key":"3_CR11","unstructured":"Chen, G., Ponomarenko, I.: Coherent Configurations. Central China Normal University Press, Wuhan (2019). http:\/\/www.pdmi.ras.ru\/~inp\/ccNOTES.pdf"},{"issue":"9","key":"3_CR12","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1007\/s00453-020-00692-9","volume":"82","author":"FV Fomin","year":"2020","unstructured":"Fomin, F.V., Golovach, P.A., Raymond, J.-F.: On the tractability of optimization problems on H-graphs. Algorithmica 82(9), 2432\u20132473 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00692-9","journal-title":"Algorithmica"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Series B 16(1), 47\u201356 (1974). https:\/\/doi.org\/10.1016\/0095-8956(74)90094-X. https:\/\/www.sciencedirect.com\/science\/article\/pii\/009589567490094X","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Grohe, M., Neuen, D., Schweitzer, P.: A faster isomorphism test for graphs of small degree. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 89\u2013100. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00018","DOI":"10.1109\/FOCS.2018.00018"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Grohe, M., Wiebking, D., Neuen, D.: Isomorphism testing for graphs excluding small minors. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 625\u2013636. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00064","DOI":"10.1109\/FOCS46700.2020.00064"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-04128-0_27","volume-title":"Algorithms - ESA 2009","author":"M Habib","year":"2009","unstructured":"Habib, M., Stacho, J.: Polynomial-time algorithm for the leafage of chordal graphs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 290\u2013300. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_27"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.7151\/dmgt.1061","volume":"18","author":"I Lin","year":"1998","unstructured":"Lin, I., McKee, T.A., West, D.B.: The leafage of a chordal graph. Discuss. Math. Graph Theory 18(1), 23\u201348 (1998). https:\/\/doi.org\/10.7151\/dmgt.1061","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/140999980","volume":"46","author":"D Lokshtanov","year":"2017","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM J. Comput. 46(1), 161\u2013189 (2017). https:\/\/doi.org\/10.1137\/140999980","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"GS Lueker","year":"1979","unstructured":"Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM 26(2), 183\u2013195 (1979). https:\/\/doi.org\/10.1145\/322123.322125","journal-title":"J. ACM"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90009-5","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Neuen, D.: Hypergraph isomorphism for groups with restricted composition factors. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbr\u00fccken, Germany, 8\u201311 July 2020 (Virtual Conference). LIPIcs, vol. 168, pp. 88:1\u201388:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.88","DOI":"10.4230\/LIPIcs.ICALP.2020.88"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1007\/BF01098279","volume":"55","author":"IN Ponomarenko","year":"1991","unstructured":"Ponomarenko, I.N.: The isomorphism problem for classes of graphs closed under contraction. J. Sov. Math. 55(2), 1621\u20131643 (1991)","journal-title":"J. Sov. Math."},{"issue":"4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1007\/BF01095641","volume":"34","author":"I Ponomarenko","year":"1986","unstructured":"Ponomarenko, I.: Polynomial isomorphism algorithm for graphs which do not pinch to K$$_{3, g}$$. J. Sov. Math. 34(4), 1819\u20131831 (1986)","journal-title":"J. Sov. Math."},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Schweitzer, P., Wiebking, D.: A unifying method for the design of algorithms canonizing combinatorial objects. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, 23\u201326 June 2019, pp. 1247\u20131258. ACM (2019)","DOI":"10.1145\/3313276.3316338"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-78773-0_47","volume-title":"LATIN 2008: Theoretical Informatics","author":"J Stacho","year":"2008","unstructured":"Stacho, J.: On 2-subcolourings of chordal graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 544\u2013554. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_47"},{"key":"3_CR26","unstructured":"Weisfeiler, B., Leman, A.: The reduction of a graph to canonical form and the algebra which appears therein. NTI Series 2, 12\u201316 (1968). https:\/\/www.iti.zcu.cz\/wl2018\/pdf\/wl_paper_translation.pdf. The URL links to an English translation"}],"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-031-15914-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:16:04Z","timestamp":1664536564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"32","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":"33% - 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":"12","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)"}}]}}