{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:49:15Z","timestamp":1743151755568,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_22","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"304-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognition and\u00a0Isomorphism of\u00a0Proper $$\\boldsymbol{H}$$-Graphs for\u00a0Unicyclic $$\\boldsymbol{H}$$ in\u00a0FPT-Time"],"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":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0071-9149","authenticated-orcid":false,"given":"Peter","family":"Zeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-96731-4_20","volume-title":"WALCOM: Algorithms and Computation","author":"D A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131","year":"2022","unstructured":"A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131, D., Hlin\u011bn\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":"22_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-031-15914-5_3","volume-title":"WG 2022","author":"V Arvind","year":"2022","unstructured":"Arvind, V., Nedela, R., Ponomarenko, I., Zeman, P.: Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 29\u201342. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_3"},{"key":"22_CR3","unstructured":"A\u011fao\u011flu, D., Hlin\u011bn\u00fd, P.: Isomorphism problem for $$S_d$$-graphs. In: MFCS, pp. 4:1\u20134:14 (2020)"},{"key":"22_CR4","unstructured":"A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131, D., et al.: Recognizing $$H$$-graphs - beyond circular-arc graphs. In: MFCS, pp. 8:1\u20138:14 (2023)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s00453-022-01033-8","volume":"85","author":"D A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131","year":"2023","unstructured":"A\u011fao\u011flu \u00c7a\u011f\u0131r\u0131c\u0131, D., Hlin\u011bn\u00fd, P.: Efficient isomorphism for $$S_d$$-graphs and $$T$$-graphs. Algorithmica 85, 352\u2013383 (2023). https:\/\/doi.org\/10.1007\/s00453-022-01033-8","journal-title":"Algorithmica"},{"key":"22_CR6","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 Math. 100, 267\u2013279 (1992)","journal-title":"Discrete Math."},{"key":"22_CR7","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":"22_CR8","unstructured":"Chaplick, S., Golovach, P.A., Hartmann, T.A., Knop, D.: Recognizing proper tree-graphs. In: IPEC, pp. 8:1\u20138:15 (2020)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-68705-6_13","volume-title":"WG 2017","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., T\u00f6pfer, M., Voborn\u00edk, J., Zeman, P.: On $$H$$-topological intersection graphs. In: Bodlaender, H., Woeginger, G. (eds.) WG 2017. LNCS, vol. 10520, pp. 167\u2013179. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_13"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2017.06.042","volume":"61","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Zeman, P.: Combinatorial problems on $$H$$-graphs. Electron. Notes Discrete Math. 61, 223\u2013229 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"22_CR11","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. Discrete Math. Theor. Comput. Sci. 15, 157\u2013182 (2013)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. 25, 390\u2013403 (1996)","journal-title":"SIAM J. Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Dinur, I., Regev, O., Smyth, C.D.: The hardness of 3 - uniform hypergraph coloring. In: FOCS, p. 33 (2002)","DOI":"10.1109\/SFCS.2002.1181880"},{"key":"22_CR15","unstructured":"Fomin, F.V., Golovach, P.A., Raymond, J.: On the tractability of optimization problems on $$H$$-graphs. In: ESA, vol. 112, pp. 30:1\u201330:14 (2018)"},{"key":"22_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. Theory Ser. B 16, 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","volume":"20","author":"JM Keil","year":"1985","unstructured":"Keil, J.M.: Finding Hamiltonian circuits in interval graphs. Inf. Process. Lett. 20, 201\u2013206 (1985)","journal-title":"Inf. Process. Lett."},{"key":"22_CR18","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. Theor. Comput. Sci. 576, 85\u2013101 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR19","unstructured":"Krawczyk, T.: Testing isomorphism of circular-arc graphs - Hsu\u2019s approach revisited. CoRR abs\/1904.04501 (2019)"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11809678_10","volume-title":"COCOON 2006","author":"MC Lin","year":"2006","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and linear time recognition of Helly circular-arc graphs. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 73\u201382. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11809678_10"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","volume":"309","author":"MC Lin","year":"2009","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Characterizations and recognition of circular-arc graphs and subclasses: a survey. Discrete Math. 309, 5618\u20135635 (2009)","journal-title":"Discrete Math."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. In: FOCS, pp. 386\u2013394 (2001)","DOI":"10.1109\/SFCS.2001.959913"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"22_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). https:\/\/doi.org\/10.1007\/BF02104746","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-981-97-0566-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T04:01:01Z","timestamp":1731470461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","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":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","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":"80","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":"28","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":"35% - 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":"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)"}}]}}