{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:04:13Z","timestamp":1743062653796,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_22","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"262-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Shortest Reconfiguration Sequence for Sliding Tokens on Spiders"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8635-8462","authenticated-orcid":false,"given":"Duc A.","family":"Hoang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8382-7684","authenticated-orcid":false,"given":"Amanj","family":"Khorramian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0895-3765","authenticated-orcid":false,"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"22_CR1","unstructured":"Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y., Sikora, F.: Token sliding on split graphs. arXiv preprint (2018)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-68705-6_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Bonamy","year":"2017","unstructured":"Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 127\u2013139. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_10"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-08404-6_8","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"P Bonsma","year":"2014","unstructured":"Bonsma, P., Kami\u0144ski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 86\u201397. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_8"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","volume":"600","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., et al.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132\u2013142 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.037","journal-title":"Theor. Comput. Sci."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2018.04.031","volume":"732","author":"ED Demaine","year":"2018","unstructured":"Demaine, E.D., Rudoy, M.: A simple proof that the $$(n^2-1)$$-puzzle is hard. Theor. Comput. Sci. 732, 80\u201384 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.04.031","journal-title":"Theor. Comput. Sci."},{"key":"22_CR6","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. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"4"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-48971-0_21","volume-title":"Algorithms and Computation","author":"E Fox-Epstein","year":"2015","unstructured":"Fox-Epstein, E., Hoang, D.A., Otachi, Y., Uehara, R.: Sliding token on bipartite permutation graphs. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 237\u2013247. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_21"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1038\/scientificamerican0264-122","volume":"210","author":"M Gardner","year":"1964","unstructured":"Gardner, M.: The hypnotic fascination of sliding-block puzzles. Sci. Am. 210, 122\u2013130 (1964)","journal-title":"Sci. Am."},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P Gopalan","year":"2009","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of boolean satisfiability: computational and structural dichotomies. SIAM J. Comput. 38(6), 2330\u20132355 (2009). https:\/\/doi.org\/10.1137\/07070440X","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"22_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"RA Hearn","year":"2005","unstructured":"Hearn, R.A., Demaine, E.D.: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theor. Comput. Sci. 343(1\u20132), 72\u201396 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.05.008","journal-title":"Theor. Comput. Sci."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A K Peters (2009)","DOI":"10.1201\/b10581"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-319-53925-6_36","volume-title":"WALCOM: Algorithms and Computation","author":"DA Hoang","year":"2017","unstructured":"Hoang, D.A., Fox-Epstein, E., Uehara, R.: Sliding tokens on block graphs. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 460\u2013471. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_36"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Hoang, D.A., Khorramian, A., Uehara, R.: Shortest reconfiguration sequence for sliding tokens on spider. arXiv preprint (2018). arXiv:1806.08291","DOI":"10.1007\/978-3-030-17402-6_22"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Hoang, D.A., Uehara, R.: Sliding tokens on a cactus. In: Proceedings of ISAAC 2016, LIPIcs, vol. 64, pp. 37:1\u201337:26. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2016.37","DOI":"10.4230\/LIPIcs.ISAAC.2016.37"},{"issue":"12\u201314","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., et al.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.12.005","journal-title":"Theor. Comput. Sci."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski, M., Medvedev, P., Milani\u010d, M.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439, 9\u201315 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.004","journal-title":"Theor. Comput. Sci."},{"issue":"35","key":"22_CR17","doi-asserted-by":"publisher","first-page":"4613","DOI":"10.1016\/j.tcs.2011.04.041","volume":"412","author":"K Makino","year":"2011","unstructured":"Makino, K., Tamaki, S., Yamamoto, M.: An exact algorithm for the boolean connectivity problem for $$k$$-CNF. Theor. Comput. Sci. 412(35), 4613\u20134618 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.04.041","journal-title":"Theor. Comput. Sci."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03898-8_24","volume-title":"Parameterized and Exact Computation","author":"AE Mouawad","year":"2013","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 281\u2013294. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_24"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-13524-3_21","volume-title":"Parameterized and Exact Computation","author":"AE Mouawad","year":"2014","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Wrochna, M.: Reconfiguration over tree decompositions. In: Cygan, M., Heggernes, P. (eds.) IPEC 2014. LNCS, vol. 8894, pp. 246\u2013257. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13524-3_21"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D Ratner","year":"1990","unstructured":"Ratner, D., Warmuth, M.: Finding a shortest solution for the $$N \\times N$$-extension of the $$15$$-puzzle is intractable. J. Symb. Comput. 10, 111\u2013137 (1990)","journal-title":"J. Symb. Comput."},{"key":"22_CR21","unstructured":"Ribeiro, M.T., dos Santos, V.F.: Personal communications, March 2018"},{"key":"22_CR22","unstructured":"Slocum, J., Sonneveld, D.: The 15 Puzzle Book: How It Drove the World Crazy. Socum Puzzle Foundations (2006)"},{"key":"22_CR23","unstructured":"Sugimori, K.: Shortest reconfiguration of sliding tokens on a tree. In: AAAC 2018, May 2018"},{"key":"22_CR24","unstructured":"Sugimori, K.: Personal communications, May 2018"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-30139-6_19","volume-title":"WALCOM: Algorithms and Computation","author":"T Yamada","year":"2016","unstructured":"Yamada, T., Uehara, R.: Shortest reconfiguration of sliding tokens on a caterpillar. In: Kaykobad, M., Petreschi, R. (eds.) WALCOM 2016. LNCS, vol. 9627, pp. 236\u2013248. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30139-6_19"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"van der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Proceedings of IPEC 2015, LIPIcs, vol. 43, pp. 282\u2013293. Schloss Dagstuhl - Leibniz-Zentrum fuer 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","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:57:23Z","timestamp":1710334643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"32% - 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":"14","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)"}}]}}