{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:19:14Z","timestamp":1772893154363,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031435867","type":"print"},{"value":"9783031435874","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_24","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"333-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Shortest Dominating Set Reconfiguration Under Token Sliding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6657-0020","authenticated-orcid":false,"given":"Jan Maty\u00e1\u0161","family":"K\u0159i\u0161\u0165an","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1419-3267","authenticated-orcid":false,"given":"Jakub","family":"Svoboda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"issue":"9","key":"24_CR1","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"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-020-09967-8","volume":"65","author":"R Belmonte","year":"2020","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 (2020). https:\/\/doi.org\/10.1007\/s00224-020-09967-8","journal-title":"Theory Comput. Syst."},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Groenland, C., Swennenhuis, C.M.F.: Parameterized complexities of dominating and independent set reconfiguration. In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021. LIPIcs, vol. 214, pp. 9:1\u20139:16 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2021.9","DOI":"10.4230\/LIPIcs.IPEC.2021.9"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.dam.2021.05.014","volume":"301","author":"M Bonamy","year":"2021","unstructured":"Bonamy, M., Dorbec, P., Ouvrard, P.: Dominating sets reconfiguration under token sliding. Discrete Appl. Math. 301, 6\u201318 (2021). https:\/\/doi.org\/10.1016\/j.dam.2021.05.014","journal-title":"Discrete Appl. Math."},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Joffard, A.: TS-reconfiguration of dominating sets in circle and circular-arc graphs. In: Fundamentals of Computation Theory, FCT, pp. 114\u2013134. Lecture Notes in Computer Science (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_8","DOI":"10.1007\/978-3-030-86593-1_8"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discrete Math. 23(4), 1905\u20131953 (2010). https:\/\/doi.org\/10.1137\/s0895480100373455","DOI":"10.1137\/s0895480100373455"},{"key":"24_CR7","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."},{"issue":"9","key":"24_CR8","doi-asserted-by":"publisher","first-page":"9758","DOI":"10.1609\/aaai.v36i9.21211","volume":"36","author":"K Gajjar","year":"2022","unstructured":"Gajjar, K., Jha, A.V., Kumar, M., Lahiri, A.: Reconfiguring shortest paths in graphs. Proc. AAAI Conf. Artif. Intelli. 36(9), 9758\u20139766 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i9.21211","journal-title":"Proc. AAAI Conf. Artif. Intelli."},{"issue":"6","key":"24_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., 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."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","volume":"651","author":"A Haddadan","year":"2016","unstructured":"Haddadan, A., et al.: The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651, 37\u201349 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.08.016","journal-title":"Theor. Comput. Sci."},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Hoang, D.A., Khorramian, A., Uehara, R.: Shortest reconfiguration sequence for sliding tokens on spiders. In: Heggernes, P. (ed.) Algorithms and Complexity - 11th International Conference, CIAC, vol. 11485, pp. 262\u2013273 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_22","DOI":"10.1007\/978-3-030-17402-6_22"},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, T.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987). https:\/\/doi.org\/10.1007\/BF02278710","journal-title":"Computing"},{"issue":"39","key":"24_CR13","doi-asserted-by":"publisher","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M Kami\u0144ski","year":"2011","unstructured":"Kami\u0144ski, M., Medvedev, P., Milani\u010d, M.: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39), 5205\u20135210 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.021","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"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), 1\u201319 (2019). https:\/\/doi.org\/10.1145\/3280825","journal-title":"ACM Trans. Algorithms"},{"key":"24_CR15","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., 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":"24_CR16","doi-asserted-by":"publisher","unstructured":"Mouawad, A.E., Nishimura, N., Pathak, V., Raman, V.: Shortest reconfiguration paths in the solution space of Boolean formulas. SIAM J. Discrete Math. 31(3), 2185\u20132200 (2017). https:\/\/doi.org\/10.1137\/16M1065288","DOI":"10.1137\/16M1065288"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/a11040052","DOI":"10.3390\/a11040052"},{"issue":"4","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1007\/s10878-015-9947-x","volume":"32","author":"A Suzuki","year":"2015","unstructured":"Suzuki, A., Mouawad, A.E., Nishimura, N.: Reconfiguration of dominating sets. J. Comb. Optim. 32(4), 1182\u20131195 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9947-x","journal-title":"J. Comb. Optim."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2021.02.019","volume":"863","author":"T Yamada","year":"2021","unstructured":"Yamada, T., Uehara, R.: Shortest reconfiguration of sliding tokens on subclasses of interval graphs. Theor. Comput. Sci. 863, 53\u201368 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.02.019","journal-title":"Theor. Comput. Sci."}],"updated-by":[{"DOI":"10.1007\/978-3-031-43587-4_31","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000}}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:37:19Z","timestamp":1699911439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_24","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-031-43587-4_31","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"14 November 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","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":"69","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":"43% - 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":"3","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)"}}]}}