{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:34:37Z","timestamp":1743035677450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_3","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"26-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Invitation to Combinatorial Reconfiguration"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"issue":"9","key":"3_CR1","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1080\/00029890.1999.12005124","volume":"106","author":"AF Archer","year":"1999","unstructured":"Archer, A.F.: A modern treatment of the 15 puzzle. Am. Math. Mon. 106(9), 793\u2013799 (1999)","journal-title":"Am. Math. Mon."},{"issue":"9","key":"3_CR2","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1007\/s00453-020-00700-y","volume":"82","author":"R Belmonte","year":"2020","unstructured":"Belmonte, R., Hanaka, T., Lampis, M., Ono, H., Otachi, Y.: Independent set reconfiguration parameterized by modular-width. Algorithmica 82(9), 2586\u20132605 (2020)","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-020-09967-8","volume":"65","author":"R Belmonte","year":"2021","unstructured":"Belmonte, R., Kim, E.J., Lampis, M., Mitsou, V., Otachi, Y., Sikora, F.: Token sliding on split graphs. Theory Comput. Syst. 65(4), 662\u2013686 (2021)","journal-title":"Theory Comput. Syst."},{"key":"3_CR4","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"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/jgt.21992","volume":"83","author":"P Bonsma","year":"2016","unstructured":"Bonsma, P.: Independent set reconfiguration in cographs and their generalizations. J. Graph Theory 83(2), 164\u2013195 (2016)","journal-title":"J. Graph Theory"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.05.015","volume":"639","author":"RC Brewster","year":"2016","unstructured":"Brewster, R.C., McGuinness, S., Moore, B., Noel, J.A.: A dichotomy theorem for circular colouring reconfiguration. Theoret. Comput. Sci. 639, 1\u201313 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR7","unstructured":"Bria\u0144ski, M., Felsner, S., Hodor, J., Micek, P.: Reconfiguring independent sets on interval graphs. In: Bonchi, F., Puglisi, S.J. (eds.) 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics, Dagstuhl, Germany, vol. 202, pp. 23:1\u201323:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"3_CR8","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. Theoret. Comput. Sci. 732, 80\u201384 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"3_CR9","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. Theoret. Comput. Sci. 343(1\u20132), 72\u201396 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A. K. Peters Ltd, Natick (2009)"},{"key":"3_CR11","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/CBO9781139506748.005","volume-title":"Surveys in Combinatorics 2013","author":"J van den Heuvel","year":"2013","unstructured":"van den 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. 409, pp. 127\u2013160. Cambridge University Press, Cambridge (2013)"},{"key":"3_CR12","unstructured":"Hoang, D.A., Uehara, R.: Sliding tokens on a cactus. In: Hong, S.-H. (ed.) 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics, Dagstuhl, Germany, vol. 64, pp. 37:1\u201337:26. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TSG.2013.2288976","volume":"5","author":"T Inoue","year":"2014","unstructured":"Inoue, T., et al.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102\u2013111 (2014)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"12\u201314","key":"3_CR14","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. Theoret. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR15","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. Theoret. Comput. Sci. 439, 9\u201315 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3280825","volume":"15","author":"D Lokshtanov","year":"2019","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. ACM Trans. Algorithms 15(1), 7:1-7:19 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Siebertz, S.: Vertex cover reconfiguration and beyond. Algorithms 11(2), Paper ID 20 (2018)","DOI":"10.3390\/a11020020"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), Paper ID 52 (2018)","DOI":"10.3390\/a11040052"},{"issue":"2","key":"3_CR19","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.: The $$(n^2-1)$$-puzzle and related relocation problems. J. Symb. Comput. 10(2), 111\u2013137 (1990)","journal-title":"J. Symb. Comput."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2017.11.003","volume":"93","author":"M Wrochna","year":"2018","unstructured":"Wrochna, M.: Reconfiguration in bounded bandwidth and tree-depth. J. Comput. Syst. Sci. 93, 1\u201310 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR21","unstructured":"van der Zanden, T.C.: Parameterized complexity of graph constraint logic. In: Husfeldt, T., Kanj, I. (eds.) 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics, Dagstuhl, Germany, vol. 43, pp. 282\u2013293. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"}],"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-3-030-96731-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:04:16Z","timestamp":1647389056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_3","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":"16 March 2022","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":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"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","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-9","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 proceedings also include 3 invited papers.","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)"}}]}}