{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:36:33Z","timestamp":1774334193176,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","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-981-95-7127-7_23","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:05Z","timestamp":1770977225000},"page":"337-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to\u00a0Reconfigure Your Alliances"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-2513","authenticated-orcid":false,"given":"Kevin","family":"Mann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Groenland, C., Nederlof, J., Swennenhuis, C.M.F.: Parameterized problems complete for nondeterministic FPT time and logarithmic space. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 193\u2013204. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00027"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Groenland, C., Swennenhuis, C.M.F.: Parameterized complexities of dominating and independent set reconfiguration. Technical report 2106.15907, ArXiv, Cornell University (2021). Revised in 2023","DOI":"10.21203\/rs.3.rs-2049659\/v1"},{"key":"23_CR3","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. Discret. Appl. Math. 301, 6\u201318 (2021)","journal-title":"Discret. Appl. Math."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J.: Bounded nondeterminism and alternation in parameterized complexity theory. In: 18th Annual IEEE Conference on Computational Complexity, CCC, pp. 13\u201329. IEEE Computer Society (2003)","DOI":"10.1109\/CCC.2003.1214407"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Fernau, H., Mann, K.: How to reconfigure your alliances. Technical report 2509.08798, ArXiv, Cornell University, USA (2025)","DOI":"10.65215\/m7e29q76"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.5614\/ejgta.2014.2.1.7","volume":"2","author":"H Fernau","year":"2014","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. 2(1), 70\u201386 (2014)","journal-title":"Electron. J. Graph Theory Appl."},{"key":"23_CR7","first-page":"37","volume":"38","author":"G Fricke","year":"2003","unstructured":"Fricke, G., Lawson, L., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T.: A note on defensive alliances in graphs. Bull. Inst. Combin. Appl. 38, 37\u201341 (2003)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"23_CR8","unstructured":"Gima, T., Ito, T., Kobayashi, Y., Otachi, Y.: Algorithmic meta-theorems for combinatorial reconfiguration revisited. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA. LIPIcs, vol.\u00a0244, pp. 61:1\u201361:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Structures of Domination in Graphs. Developments in Mathematics, vol.\u00a066. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-58892-2"},{"key":"23_CR10","unstructured":"van\u00a0den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013)"},{"issue":"12\u201314","key":"23_CR11","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":"23_CR12","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":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"041906","DOI":"10.1103\/PhysRevE.72.041906","volume":"72","author":"BJ Kim","year":"2005","unstructured":"Kim, B.J., Liu, J., Um, J., Lee, S.I.: Instability of defensive alliances in the predator-prey model on complex networks. Phys. Rev. E 72(4), 041906 (2005)","journal-title":"Phys. Rev. E"},{"key":"23_CR14","first-page":"157","volume":"48","author":"P Kristiansen","year":"2004","unstructured":"Kristiansen, P., Hedetniemi, S.M., Hedetniemi, S.T.: Alliances in graphs. J. Comb. Math. Comb. Comput. 48, 157\u2013177 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"23_CR15","unstructured":"Mouawad, A.E.: On reconfiguration problems: structure and tractability. Ph.D. thesis, University of Waterloo, Ontario, Canada (2015)"},{"issue":"1","key":"23_CR16","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)","journal-title":"Algorithmica"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52:1\u201325 (2018)","DOI":"10.3390\/a11040052"},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.akcej.2017.05.002","volume":"15","author":"K Ouazine","year":"2018","unstructured":"Ouazine, K., Slimani, H., Tari, A.: Alliances in graphs: parameters, properties and applications\u2013a survey. AKCE Int. J. Graphs Combin. 15(2), 115\u2013154 (2018)","journal-title":"AKCE Int. J. Graphs Combin."},{"issue":"36","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.12988\/imf.2006.06152","volume":"1","author":"JA Rodriguez","year":"2006","unstructured":"Rodriguez, J.A., Sigarreta, J.M.: Offensive alliances in cubic graphs. Int. Math. Forum 1(36), 1773\u20131782 (2006)","journal-title":"Int. Math. Forum"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s11227-011-0607-3","volume":"61","author":"H Seba","year":"2012","unstructured":"Seba, H., Lagraa, S., Kheddouci, H.: Alliance-based clustering scheme for group key management in mobile ad hoc networks. J. Supercomput. 61(3), 481\u2013501 (2012)","journal-title":"J. Supercomput."},{"key":"23_CR21","unstructured":"Shafique, K.H.: Partitioning a graph in alliances and its application to data clustering. Ph.D. thesis, University of Central Florida, Orlando, USA (2004)"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"042902","DOI":"10.1103\/PhysRevE.64.042902","volume":"64","author":"G Szab\u00f3","year":"2001","unstructured":"Szab\u00f3, G., Cz\u00e1r\u00e1n, T.: Defensive alliances in spatial models of cyclical population interactions. Phys. Rev. E 64(4), 042902 (2001)","journal-title":"Phys. Rev. E"},{"key":"23_CR23","first-page":"141","volume":"105","author":"IG Yero","year":"2017","unstructured":"Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: A survey on alliances in graphs: defensive alliances. Utilitas Math. 105, 141\u2013172 (2017)","journal-title":"Utilitas Math."}],"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-981-95-7127-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:14:13Z","timestamp":1774325653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_23","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":"14 February 2026","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":"Perugia","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}