{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:55:35Z","timestamp":1763466935292,"version":"3.45.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091192","type":"print"},{"value":"9783032091208","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"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-09120-8_7","type":"book-chapter","created":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:18Z","timestamp":1763466738000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterised Algorithms for\u00a0Temporally Satisfying Reconfiguration Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4203-5140","authenticated-orcid":false,"given":"Tom","family":"Davot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0266-3292","authenticated-orcid":false,"given":"Jessica","family":"Enright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3322-0176","authenticated-orcid":false,"given":"Laura","family":"Larios-Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"issue":"9","key":"7_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":"7_CR2","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). https:\/\/doi.org\/10.1007\/S00224-020-09967-8","journal-title":"Theory Comput. Syst."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Groenland, C., Swennenhuis, C.M.F.: Parameterized complexities of dominating and independent set reconfiguration. In: Golovach, P.A., Zehavi, M. (eds.) 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Lisbon, Portugal, 8\u201310 September 2021. LIPIcs, vol.\u00a0214, pp. 9:1\u20139:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.IPEC.2021.9","DOI":"10.4230\/LIPICS.IPEC.2021.9"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/JAGM.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996). https:\/\/doi.org\/10.1006\/JAGM.1996.0049","journal-title":"J. Algorithms"},{"key":"7_CR5","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":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-86593-1_8","volume-title":"Fundamentals of Computation Theory","author":"N Bousquet","year":"2021","unstructured":"Bousquet, N., Joffard, A.: TS-reconfiguration of dominating sets in circle and circular-arc graphs. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 114\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_8"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Joffard, A., Ouvrard, P.: Linear transformations between dominating sets in the tar-model. In: Cao, Y., Cheng, S., Li, M. (eds.) 31st International Symposium on Algorithms and Computation, ISAAC 2020, 14\u201318 December 2020, Hong Kong, China (Virtual Conference). LIPIcs, vol.\u00a0181, pp. 37:1\u201337:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2020.37","DOI":"10.4230\/LIPICS.ISAAC.2020.37"},{"key":"7_CR8","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":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-18771-5_50","volume-title":"Graph-Grammars and Their Application to Computer Science","author":"B Courcelle","year":"1987","unstructured":"Courcelle, B.: On context-free sets of graphs and their monadic second-order theory. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 133\u2013146. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-18771-5_50"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: Chapter 5 - graph rewriting: an algebraic and logic approach. In: Van Leeuwen, J. (ed.) Formal Models and Semantics, pp. 193\u2013242. Handbook of Theoretical Computer Science. Elsevier, Amsterdam (1990). https:\/\/doi.org\/10.1016\/B978-0-444-88074-1.50010-X. https:\/\/www.sciencedirect.com\/science\/article\/pii\/B978044488074150010X","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-13075-0_31","volume-title":"Algorithms and Computation","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., et al.: Polynomial-time algorithm for sliding tokens on trees. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 389\u2013400. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_31"},{"key":"7_CR13","unstructured":"Dondi, R., Lafond, M.: On the complexity of temporal arborescence reconfiguration. In: 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), pp. 10\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Enright, J.A., Hand, S.D., Larios-Jones, L., Meeks, K.: Structural parameters for dense temporal graphs. CoRR abs\/2404.19453 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2404.19453","DOI":"10.48550\/ARXIV.2404.19453"},{"issue":"1\u20133","key":"7_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/J.TCS.2006.05.023","volume":"359","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Paschos, V.T.: Completeness in approximation classes beyond APX. Theor. Comput. Sci. 359(1\u20133), 369\u2013377 (2006). https:\/\/doi.org\/10.1016\/J.TCS.2006.05.023","journal-title":"Theor. Comput. Sci."},{"key":"7_CR16","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":"7_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)"},{"key":"7_CR18","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics. North Holland (2004). https:\/\/books.google.co.uk\/books?id=8xo-VrWo5_QC"},{"key":"7_CR19","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":"7_CR20","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), 72\u201396 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.05.008. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397505003105, game Theory Meets Theoretical Computer Science"},{"issue":"12\u201314","key":"7_CR21","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., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: 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":"7_CR22","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"7_CR23","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85563-5","volume-title":"Computation and Approximation","author":"V Gupta","year":"2021","unstructured":"Gupta, V., Rassias, M.T.: Computation and Approximation. SM, Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85563-5"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/S00453-011-9554-X","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012). https:\/\/doi.org\/10.1007\/S00453-011-9554-X","journal-title":"Algorithmica"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Mouawad, A.E.: The complexity of independent set reconfiguration on bipartite graphs. ACM Trans. Algorithms 15(1), 7:1\u20137:19 (2019). https:\/\/doi.org\/10.1145\/3280825","DOI":"10.1145\/3280825"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/S00453-016-0159-2","volume":"78","author":"AE Mouawad","year":"2017","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. Algorithmica 78(1), 274\u2013297 (2017). https:\/\/doi.org\/10.1007\/S00453-016-0159-2","journal-title":"Algorithmica"},{"issue":"4","key":"7_CR27","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1007\/S10878-015-9947-X","volume":"32","author":"A Suzuki","year":"2016","unstructured":"Suzuki, A., Mouawad, A.E., Nishimura, N.: Reconfiguration of dominating sets. J. Comb. Optim. 32(4), 1182\u20131195 (2016). https:\/\/doi.org\/10.1007\/S10878-015-9947-X","journal-title":"J. Comb. Optim."},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9 Tardos","year":"1985","unstructured":"Tardos, \u00c9.: A strongly polynomial minimum cost circulation algorithm. Comb. 5(3), 247\u2013256 (1985). https:\/\/doi.org\/10.1007\/BF02579369","journal-title":"Comb."},{"key":"7_CR29","unstructured":"Verheije, M.: Algorithms for domination problems on temporal graphs. Master\u2019s thesis, Utrecht University (2021)"},{"key":"7_CR30","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). https:\/\/doi.org\/10.1016\/J.JCSS.2017.11.003","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09120-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:52:19Z","timestamp":1763466739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09120-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"ISBN":["9783032091192","9783032091208"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09120-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"19 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}