{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:04:48Z","timestamp":1767315888882,"version":"3.48.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_11","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:00:53Z","timestamp":1767315653000},"page":"149-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple Quadratic Kernel for\u00a0Token Jumping on\u00a0Surfaces"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3592-6105","authenticated-orcid":false,"given":"Daniel W.","family":"Cranston","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2729-127X","authenticated-orcid":false,"given":"Moritz","family":"M\u00fchlenthaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7282-0727","authenticated-orcid":false,"given":"Benjamin","family":"Peyrille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. I. Discharging. Illinois J. Math. 21(3), 429\u2013490 (1977). http:\/\/projecteuclid.org.proxy.library.vcu.edu\/euclid.ijm\/1256049011","DOI":"10.1215\/ijm\/1256049011"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. II. Reducibility. Illinois J. Math. 21(3), 491\u2013567 (1977). http:\/\/projecteuclid.org.proxy.library.vcu.edu\/euclid.ijm\/1256049012","DOI":"10.1215\/ijm\/1256049012"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Appel, K.I., Haken, W.: Every planar map is four colorable, vol.\u00a098. American Mathematical Soc. (1989)","DOI":"10.1090\/conm\/098"},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2914","DOI":"10.1007\/S00453-021-00848-1","volume":"83","author":"V Bartier","year":"2021","unstructured":"Bartier, V., Bousquet, N., Dallard, C., Lomer, K., Mouawad, A.E.: On girth and the parameterized complexity of token sliding and token jumping. Algorithmica 83(9), 2914\u20132951 (2021). https:\/\/doi.org\/10.1007\/S00453-021-00848-1","journal-title":"Algorithmica"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bartier, V., Bousquet, N., M\u00fchlenthaler, M.: Independent set reconfiguration in h-free graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 35\u201349. Springer (2024)","DOI":"10.1007\/978-3-031-75409-8_3"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Groenland, C., Swennenhuis, C.M.F.: Parameterized complexities of dominating and independent set reconfiguration (2023). https:\/\/arxiv.org\/abs\/2106.15907","DOI":"10.21203\/rs.3.rs-2049659\/v1"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0095-8956(78)90073-4","volume":"24","author":"A Bouchet","year":"1978","unstructured":"Bouchet, A.: Orientable and nonorientable genus of the complete bipartite graph. J. Comb. Theory Ser. B 24(1), 24\u201333 (1978). https:\/\/doi.org\/10.1016\/0095-8956(78)90073-4","journal-title":"J. Comb. Theory Ser. B"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bousquet, N., Mary, A., Parreau, A.: Token jumping in minor-closed classes. In: International Symposium on Fundamentals of Computation Theory, pp. 136\u2013149. Springer (2017)","DOI":"10.1007\/978-3-662-55751-8_12"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/J.COSREV.2024.100663","volume":"53","author":"N Bousquet","year":"2024","unstructured":"Bousquet, N., Mouawad, A.E., Nishimura, N., Siebertz, S.: A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53, 100663 (2024). https:\/\/doi.org\/10.1016\/J.COSREV.2024.100663","journal-title":"Comput. Sci. Rev."},{"key":"11_CR10","first-page":"332","volume":"24","author":"PJ Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Quart. J. Math. 24, 332\u2013333 (1890)","journal-title":"Quart. J. Math."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"van\u00a0den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics 2013, London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/CBO9781139506748.005","DOI":"10.1017\/CBO9781139506748.005"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM (JACM) 21(4), 549\u2013568 (1974)","journal-title":"J. ACM (JACM)"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Ito, T., Kaminski, M.J., Ono, H.: Fixed-parameter tractability of token jumping on planar graphs. In: Algorithms and Computation \u2013 25th International Symposium, ISAAC. Lecture Notes in Computer Science, vol.\u00a08889, pp. 208\u2013219. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_17","DOI":"10.1007\/978-3-319-13075-0_17"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/J.JCSS.2018.02.004","volume":"95","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Mouawad, A.E., Panolan, F., Ramanujan, M.S., Saurabh, S.: Reconfiguration on sparse graphs. J. Comput. Syst. Sci. 95, 122\u2013131 (2018). https:\/\/doi.org\/10.1016\/J.JCSS.2018.02.004","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins University Press (2001)","DOI":"10.56021\/9780801866890"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/A11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/A11040052","journal-title":"Algorithms"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02993245","volume":"28","author":"G von Ringel","year":"1965","unstructured":"von Ringel, G.: Das Geschlecht des vollst\u00e4ndigen paaren Graphen. Abh. Math. Semin. Univ. Hambg. 28, 139\u2013150 (1965)","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 571\u2013575 (1996)","DOI":"10.1145\/237814.238005"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"van\u00a0der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: 10th International Symposium on Parameterized and Exact Computation, IPEC. LIPIcs, vol.\u00a043, pp. 282\u2013293. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPICS.IPEC.2015.282","DOI":"10.4230\/LIPICS.IPEC.2015.282"}],"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-032-11835-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:00:54Z","timestamp":1767315654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Otzenhausen","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}