{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:58Z","timestamp":1770921418081,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-3-032-17801-5_24","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:29Z","timestamp":1770918809000},"page":"317-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Algorithms for\u00a0Locally Minimal Defensive Alliance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7514-0708","authenticated-orcid":false,"given":"Ajinkya","family":"Gaikwad","sequence":"first","affiliation":[]},{"given":"Soumen","family":"Maity","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7847-6402","authenticated-orcid":false,"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.dam.2018.05.061","volume":"266","author":"C Bazgan","year":"2019","unstructured":"Bazgan, C., Fernau, H., Tuza, Z.: Aspects of upper defensive alliances. Discret. Appl. Math. 266, 111\u2013120 (2019)","journal-title":"Discret. Appl. Math."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.dam.2018.04.001","volume":"251","author":"B Bliem","year":"2018","unstructured":"Bliem, B., Woltran, S.: Defensive alliances in graphs of bounded treewidth. Discret. Appl. Math. 251, 334\u2013339 (2018)","journal-title":"Discret. Appl. Math."},{"key":"24_CR3","first-page":"23","volume":"58","author":"A Cami","year":"2006","unstructured":"Cami, A., Balakrishnan, H., Deo, N., Dutton, R.: On the complexity of finding optimal global alliances. J. Combin. Math. Combin. Comput. 58, 23\u201331 (2006)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"24_CR4","unstructured":"Enciso, R.: Alliances in graphs: parameterized algorithms and on partitioning series -parallel graphs. Ph.D. thesis, University of Central Florida, USA (2009)"},{"key":"24_CR5","unstructured":"Fernau, H., Raible, D.: Alliances in graphs: a complexity-theoretic study. In: Proceeding Volume II of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (2007)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-78825-8_3","volume-title":"Combinatorial Algorithms","author":"H Fernau","year":"2018","unstructured":"Fernau, H.: Extremal kernelization: a commemorative paper. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) Combinatorial Algorithms, pp. 24\u201336. Springer International Publishing, Cham (2018)"},{"key":"24_CR7","first-page":"61","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20\u201326, 2007, Proceedings","author":"H Fernau","year":"2007","unstructured":"Fernau, H., Raible, D.: Alliances in graphs: a complexity-theoretic study. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F., Bielikov\u00e1, M. (eds.) SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20\u201326, 2007, Proceedings, vol. II, pp. 61\u201370. Institute of Computer Science AS CR, Prague (2007)"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Fernau, H., Rodriguez-Velazquez, J.A.: A survey on alliances and related parameters in graphs. Electronic J. Graph Theory Appl. 2(1) (2014). https:\/\/doi.org\/10.5614\/ejgta.2014.2.1.7","DOI":"10.5614\/ejgta.2014.2.1.7"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.dam.2008.06.001","volume":"157","author":"H Fernau","year":"2009","unstructured":"Fernau, H., Rodr\u00edguez, J.A., Sigarreta, J.M.: Offensive r-alliances in graphs. Discret. Appl. Math. 157(1), 177\u2013182 (2009)","journal-title":"Discret. Appl. Math."},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction obstructions for treewidth. J. Comb. Theory Ser. B 101(5), 302\u2013314 (2011). https:\/\/doi.org\/10.1016\/j.jctb.2011.02.008, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895611000256","DOI":"10.1016\/j.jctb.2011.02.008"},{"key":"24_CR11","first-page":"37","volume":"38","author":"G Fricke","year":"2003","unstructured":"Fricke, G., Lawson, L., Haynes, T., Hedetniemi, M., Hedetniemi, S.: A note on defensive alliances in graphs. Bull. Inst. Combin. Appl. 38, 37\u201341 (2003)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"24_CR12","unstructured":"Gaikwad, A., Maity, S., Tripathi, S.K.: Parameterized complexity of locally minimal defensive alliances. CoRR abs\/2105.10742 (2021), https:\/\/arxiv.org\/abs\/2105.10742"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-67899-9_11","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Gaikwad","year":"2021","unstructured":"Gaikwad, A., Maity, S., Tripathi, S.K.: Parameterized complexity of locally minimal defensive alliances. In: Mudgal, A., Subramanian, C.R. (eds.) Algorithms and Discrete Applied Mathematics, pp. 135\u2013148. Springer International Publishing, Cham (2021)"},{"key":"24_CR14","unstructured":"Horn, B.: Parameterized complexity of defensive alliances. Master\u2019s thesis, Utrecht University (2023), https:\/\/studenttheses.uu.nl\/handle\/20.500.12932\/43668, master\u2019s thesis"},{"key":"24_CR15","first-page":"137","volume":"68","author":"LH Jamieson","year":"2009","unstructured":"Jamieson, L.H., Hedetniemi, S.T., McRae, A.A.: The algorithmic complexity of alliances in graphs. J. Comb. Math. Comb. Comput. 68, 137\u2013150 (2009)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"24_CR16","first-page":"157","volume":"48","author":"P Kristiansen","year":"2004","unstructured":"Kristiansen, P., Hedetniemi, M., Hedetniemi, S.: Alliances in graphs. J. Comb. Math. Comb. Comput. 48, 157\u2013177 (2004)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"24_CR17","unstructured":"Carvajal, R., Matamala, M., Rapaport, I., Schabanel, N.: Small alliances in graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) Mathematical Foundations of Computer Science, MFCS 2007, LNCS. vol.\u00a04708. Springer Berlin Heidelberg, Berlin, Heidelberg (2007)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.endm.2006.06.074","volume":"25","author":"J Rodr\u00edguez-Vel\u00e1zquez","year":"2006","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J., Sigarreta, J.: Global offensive alliances in graphs. Electron. Notes Discrete Math. 25, 157\u2013164 (2006)","journal-title":"Electron. Notes Discrete Math."},{"key":"24_CR19","unstructured":"Shafique, K.H.: Partitioning a graph in alliances and its application to data clustering. Ph.D. thesis, University of Central Florida (2004)"},{"issue":"8","key":"24_CR20","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1016\/j.dam.2008.12.006","volume":"157","author":"J Sigarreta","year":"2009","unstructured":"Sigarreta, J., Bermudo, S., Fernau, H.: On the complement graph and defensive $$k$$-alliances. Discret. Appl. Math. 157(8), 1687\u20131695 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"24_CR21","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1016\/j.aml.2006.02.001","volume":"19","author":"J Sigarreta","year":"2006","unstructured":"Sigarreta, J., Rodr\u00edguez, J.: On defensive alliances and line graphs. Appl. Math. Lett. 19(12), 1345\u20131350 (2006)","journal-title":"Appl. Math. Lett."},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2008.02.007","volume":"157","author":"J Sigarreta","year":"2009","unstructured":"Sigarreta, J., Rodr\u00edguez, J.: On the global offensive alliance number of a graph. Discret. Appl. Math. 157(2), 219\u2013226 (2009)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:31Z","timestamp":1770918811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_24","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}