{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:59Z","timestamp":1773762659098,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030967307","type":"print"},{"value":"9783030967314","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-030-96731-4_20","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"239-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphism Testing for\u00a0T-graphs in\u00a0FPT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1691-0434","authenticated-orcid":false,"given":"Deniz","family":"A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2125-1514","authenticated-orcid":false,"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"20_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR abs\/2107.10689 (2021)","DOI":"10.1007\/978-3-031-15914-5_3"},{"key":"20_CR3","unstructured":"A\u011fao\u011flu, D., Hlin\u011bn\u00fd, P.: Isomorphism problem for $$S_d$$-graphs. In: MFCS 2020. LIPIcs, vol. 170, pp. 4:1\u20134:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"20_CR4","unstructured":"A\u011fao\u011flu, D., Hlin\u011bn\u00fd, P.: Isomorphism testing for T-graphs in FPT. CoRR abs\/2111.10910 (2021)"},{"key":"20_CR5","unstructured":"A\u011fao\u011flu, D., Hlin\u011bn\u00fd, P.: Efficient isomorphism for $$S_d$$-graphs and $$T$$-graphs. CoRR abs\/1907.01495 (2021)"},{"key":"20_CR6","unstructured":"Babai, L.: Monte Carlo algorithms in graph isomorphism testing. Technical report, 79\u201310, Universit\u00e9 de Montr\u00e9al, 42 p. (1979)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 171\u2013183 (1983)","DOI":"10.1145\/800061.808746"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M., Hujter, M., Tuza, Z.: Precoloring extension. I. interval graphs. Discrete Mathe. 100, 267\u2013279 (1992)","journal-title":"Discrete Mathe."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-33293-7_21","volume-title":"Parameterized and Exact Computation","author":"A Bouland","year":"2012","unstructured":"Bouland, A., Dawar, A., Kopczy\u0144ski, E.: On tractable parameterizations of graph isomorphism. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 218\u2013230. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33293-7_21"},{"key":"20_CR11","unstructured":"Chaplick, S., T\u00f6pfer, M., Voborn\u00edk, J., Zeman, P.: On H-topological intersection graphs. CoRR abs\/1608.02389 (2016). https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00846-3"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.3230110103","volume":"11","author":"CJ Colbourn","year":"1981","unstructured":"Colbourn, C.J.: On testing isomorphism of permutation graphs. Networks 11(1), 13\u201321 (1981)","journal-title":"Networks"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1137\/0210015","volume":"10","author":"CJ Colbourn","year":"1981","unstructured":"Colbourn, C.J., Booth, K.S.: Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM J. Comput. 10(1), 203\u2013225 (1981)","journal-title":"SIAM J. Comput."},{"key":"20_CR14","first-page":"157","volume":"15","author":"AR Curtis","year":"2013","unstructured":"Curtis, A.R., et al.: Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15, 157\u2013182 (2013)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: 21st Annual Symposium on Foundations of Computer Science (FOCS), pp. 36\u201341 (1980)","DOI":"10.1109\/SFCS.1980.34"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theor. Ser. B 16(1), 47\u201356 (1974)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Ann. Discrete Math. 57 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: STOC, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2015.02.007","volume":"576","author":"P Klav\u00edk","year":"2015","unstructured":"Klav\u00edk, P., Kratochv\u00edl, J., Otachi, Y., Saitoh, T.: Extending partial representations of subclasses of chordal graphs. Theoret. Comput. Sci. 576, 85\u2013101 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR20","unstructured":"Krawczyk, T.: Testing isomorphism of circular-arc graphs - Hsu\u2019s approach revisited. CoRR abs\/1904.04501 (2019)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM J. Comput., 161\u2013189 (2017)","DOI":"10.1137\/140999980"},{"issue":"40","key":"20_CR22","doi-asserted-by":"publisher","first-page":"3635","DOI":"10.1016\/j.tcs.2010.06.007","volume":"411","author":"Y Matsui","year":"2010","unstructured":"Matsui, Y., Uehara, R., Uno, T.: Enumeration of the perfect sequences of a chordal graph. Theoret. Comput. Sci. 411(40), 3635\u20133641 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980, pp. 225\u2013235 (1980)","DOI":"10.1145\/800141.804670"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Rose, D., Lueker, G., Tarjan, R.E.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","DOI":"10.1137\/0205021"},{"key":"20_CR25","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, 1426\u20131481 (1985)","journal-title":"J. Sov. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T06:56:59Z","timestamp":1674975419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_20","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":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","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":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"34% - 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":"2-9","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 proceedings also include 3 invited papers.","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)"}}]}}