{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:38:30Z","timestamp":1743104310427,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_15","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"176-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Circle Graph Isomorphism in\u00a0Almost Linear Time"],"prefix":"10.1007","author":[{"given":"V\u00edt","family":"Kalisz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Klav\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Zeman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"15_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley Publishing Company (1974)"},{"issue":"4\u20135","key":"15_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\u20135), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02579301","volume":"7","author":"A Bouchet","year":"1987","unstructured":"Bouchet, A.: Reducing prime graphs and recognizing circle graphs. Combinatorica 7(3), 243\u2013254 (1987)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(87)90132-4","volume":"66","author":"A Bouchet","year":"1987","unstructured":"Bouchet, A.: Unimodularity and circle graphs. Discret. Math. 66(1\u20132), 203\u2013208 (1987)","journal-title":"Discret. Math."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"WH Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods 3(2), 214\u2013228 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"WH Cunningham","year":"1980","unstructured":"Cunningham, W.H., Edmonds, J.: A combinatorial decomposition theory. Can. J. Math. 32(3), 734\u2013765 (1980)","journal-title":"Can. J. Math."},{"issue":"1","key":"15_CR7","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(1), 157\u2013182 (2013)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E Dahlhaus","year":"1998","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205\u2013240 (1998)","journal-title":"J. Algorithms"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Even, S., Itai, A.: Queues, stacks, and graphs. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 71\u201376 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50011-7"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H de Fraysseix","year":"1981","unstructured":"de Fraysseix, H.: Local complementation and interlacement graphs. Discret. Math. 33(1), 29\u201335 (1981)","journal-title":"Discret. Math."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00009461","volume":"22","author":"H de Fraysseix","year":"1999","unstructured":"de Fraysseix, H., de Mendez, P.O.: On a characterization of gauss codes. Discrete Comput. Geom. 22(2), 287\u2013295 (1999)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"CP Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.: Recognizing circle graphs in polynomial time. J. ACM 36(3), 435\u2013473 (1989)","journal-title":"J. ACM"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s00453-013-9745-8","volume":"69","author":"E Gioan","year":"2014","unstructured":"Gioan, E., Paul, C., Tedder, M., Corneil, D.: Practical and efficient circle graph recognition. Algorithmica 69(4), 759\u2013788 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9745-8","journal-title":"Algorithmica"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s00453-013-9752-9","volume":"69","author":"E Gioan","year":"2014","unstructured":"Gioan, E., Paul, C., Tedder, M., Corneil, D.: Practical and efficient split decomposition via graph-labelled trees. Algorithmica 69(4), 789\u2013843 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539793260726","volume":"24","author":"WL Hsu","year":"1995","unstructured":"Hsu, W.L.: $$O(M \\cdot N)$$ algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput. 24(3), 411\u2013439 (1995)","journal-title":"SIAM J. Comput."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-69903-3_32","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"MC Lin","year":"2008","unstructured":"Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L.: A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 355\u2013366. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69903-3_32"},{"key":"15_CR17","unstructured":"Naji, W.: Graphes de cordes: une caracterisation et ses applications, Ph. D. thesis, l\u2019Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble (1985)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79\u2013100 (2005)","DOI":"10.1016\/j.jctb.2005.03.003"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y Shiloach","year":"1981","unstructured":"Shiloach, Y.: Fast canonization of circular strings. J. Algorithms 2(2), 107\u2013121 (1981)","journal-title":"J. Algorithms"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"JP Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. Algorithms 16(2), 264\u2013282 (1994)","journal-title":"J. Algorithms"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations. Field Institute Monographs (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:23:22Z","timestamp":1672550602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"44% - 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":"7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}