{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:42:44Z","timestamp":1743021764524,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"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-95018-7_22","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"279-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Intractability of\u00a0Defensive Alliance Problem"],"prefix":"10.1007","author":[{"given":"Ajinkya","family":"Gaikwad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumen","family":"Maity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuvam Kant","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"22_CR1","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."},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7151\/dmgt.1340","volume":"27","author":"M Chellali","year":"2007","unstructured":"Chellali, M., Haynes, T.W.: Global alliances and independence in trees. Discuss. Math. Graph Theory 27(1), 19\u201327 (2007)","journal-title":"Discuss. Math. Graph Theory"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"22_CR5","unstructured":"Enciso, R.: Alliances in graphs: parameterized algorithms and on partitioning series -parallel graphs. Ph.D. thesis, USA (2009)"},{"key":"22_CR6","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":"22_CR7","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":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-65621-8_11","volume-title":"Distributed Computing and Internet Technology","author":"A Gaikwad","year":"2021","unstructured":"Gaikwad, A., Maity, S., Tripathi, S.K.: Parameterized complexity of defensive and offensive alliances in graphs. In: Goswami, D., Hoang, T.A. (eds.) ICDCIT 2021. LNCS, vol. 12582, pp. 175\u2013187. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-65621-8_11"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Ganian, R., Klute, F., Ordyniak, S.: On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica 83, 297\u2013336 (2020)","DOI":"10.1007\/s00453-020-00758-8"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.dam.2017.02.004","volume":"223","author":"M Kiyomi","year":"2017","unstructured":"Kiyomi, M., Otachi, Y.: Alliances in graphs of bounded clique-width. Discret. Appl. Math. 223, 91\u201397 (2017)","journal-title":"Discret. Appl. Math."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"22_CR12","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":"22_CR13","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.: Graph minors. III. planar tree-width. J. Comb. Theor. Ser. B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"22_CR15","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."},{"issue":"8","key":"22_CR16","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":"22_CR17","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":"22_CR18","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."},{"key":"22_CR19","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:07:23Z","timestamp":1642982843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_22","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":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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":"6","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":"Conference was held virtually.","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)"}}]}}