{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:33:20Z","timestamp":1742927600522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_9","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"106-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Isomorphism Restricted by Lists"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Klav\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"Knop","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":[[2020,10,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: STOC (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Grigoryev, D., Mount, D.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: STOC 1982, pp. 310\u2013324. ACM (1982)","DOI":"10.1145\/800070.802206"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 11(4), 631\u2013643 (1990)","journal-title":"J. Algorithms"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J Cai","year":"1992","unstructured":"Cai, J., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389\u2013410 (1992). https:\/\/doi.org\/10.1007\/BF01305232","journal-title":"Combinatorica"},{"issue":"1","key":"9_CR5","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"},{"key":"9_CR6","unstructured":"Colbourn, C.J., Colbourn, M.J.: Isomorphism problems involving self-complementary graphs and tournaments. In: Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing, Congr. Numer. vol. 22, pp. 153\u2013164 (1978)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0209025","volume":"9","author":"DG Corneil","year":"1980","unstructured":"Corneil, D.G., Kirkpatrick, D.G.: A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM J. Comput. 9(2), 281\u2013297 (1980)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173, 3rd edn. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"3"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-662-43948-7_41","volume-title":"Automata, Languages, and Programming","author":"J Fiala","year":"2014","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers with applications to planar graphs. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 489\u2013501. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_41"},{"key":"9_CR10","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: 3-connected reduction for regular graph covers. CoRR abs\/1503.06556 (2016)"},{"key":"9_CR11","unstructured":"Fiala, J., Klav\u00edk, P., Kratochv\u00edl, J., Nedela, R.: Algorithmic aspects of regular graph covers. CoRR abs\/1609.03013 (2016)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutation groups. In: FOCS, pp. 36\u201341. IEEE (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"9_CR13","volume-title":"Descriptive Complexity, Canonisation, and Definable Graph Structure Theory","author":"M Grohe","year":"2012","unstructured":"Grohe, M.: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Cambridge University Press, Cambridge (2012)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, STOC 2012, pp. 173\u2013192 (2012)","DOI":"10.1145\/2213977.2213996"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Grohe, M., Neuen, D., Schweitzer, P.: A faster isomorphism test for graphs of small degree. SIAM J. Comput. (2020)","DOI":"10.1137\/19M1245293"},{"key":"9_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Isomorphism of planar graphs. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of computer computations, pp. 131\u2013152. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_13","DOI":"10.1007\/978-1-4684-2001-2_13"},{"issue":"3","key":"9_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/S0097539793260726","volume":"24","author":"WL Hsu","year":"1995","unstructured":"Hsu, W.L.: $${\\cal{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":"9_CR21","unstructured":"Kawarabayashi, K.: Graph isomorphism for bounded genus graphs in linear time. CoRR abs\/1511.02460 (2015)"},{"key":"9_CR22","unstructured":"Klav\u00edk, P., Zeman, P.: Automorphism groups of geometrically represented graphs. In: STACS 2015, LIPIcs, vol. 30, pp. 540\u2013553 (2015)"},{"key":"9_CR23","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. In: FOCS, pp. 186\u2013195 (2014)","DOI":"10.1109\/FOCS.2014.28"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM J. Comput. 10(1), 11\u201321 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR25","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 (JACM) 26(2), 183\u2013195 (1979)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"9_CR26","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","volume":"3","author":"S Mac Lane","year":"1937","unstructured":"Mac Lane, S.: A structural characterization of planar combinatorial graphs. Duke Math. J. 3(3), 460\u2013472 (1937)","journal-title":"Duke Math. J."},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R Mathon","year":"1979","unstructured":"Mathon, R.: A note on the graph isomorphism counting problem. Inf. Process. Lett. 8(3), 131\u2013136 (1979)","journal-title":"Inf. Process. Lett."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-12689-9_114","volume-title":"Foundations of Computation Theory","author":"GL Miller","year":"1983","unstructured":"Miller, G.L.: Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 310\u2013327. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-12689-9_114"},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1007\/BF01098279","volume":"55","author":"I Ponomarenko","year":"1991","unstructured":"Ponomarenko, I.: The isomorphism problem for classes of graphs closed under contraction. J. Sov. Math. 55(2), 1621\u20131643 (1991)","journal-title":"J. Sov. Math."},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1999.1919","volume":"77","author":"N Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P.: Graph minors XVI. excluding a non-planar graph. J. Comb. Theor. Ser. B 77, 1\u201327 (1999)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"issue":"8","key":"9_CR33","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1587\/transfun.E98.A.1838","volume":"98","author":"A Takaoka","year":"2015","unstructured":"Takaoka, A.: Graph isomorphism completeness for trapezoid graphs. IEICE Trans. Fundam. Electron. 98(8), 1838\u20131840 (2015)","journal-title":"IEICE Trans. Fundam. Electron."},{"key":"9_CR34","first-page":"226","volume":"51","author":"B Trakhtenbrot","year":"1958","unstructured":"Trakhtenbrot, B.: Towards a theory of non-repeating contact schemes. Trudi Mat. Inst. Akad. Nauk SSSR 51, 226\u2013269 (1958)","journal-title":"Trudi Mat. Inst. Akad. Nauk SSSR"},{"issue":"1","key":"9_CR35","doi-asserted-by":"publisher","first-page":"60","DOI":"10.3390\/a6010060","volume":"6","author":"R Uehara","year":"2013","unstructured":"Uehara, R.: Tractabilities and intractabilities on geometric intersection graphs. Algorithms 6(1), 60\u201383 (2013)","journal-title":"Algorithms"},{"issue":"3","key":"9_CR36","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.dam.2004.06.008","volume":"145","author":"R Uehara","year":"2005","unstructured":"Uehara, R., Toda, S., Nagoya, T.: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discret. Appl. Math. 145(3), 479\u2013482 (2005)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54(1), 150\u2013168 (1932)","journal-title":"Am. J. Math."}],"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-030-60440-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:53Z","timestamp":1710266453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"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.7","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.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 conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}