{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:56:14Z","timestamp":1764060974123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030656201"},{"type":"electronic","value":"9783030656218"}],"license":[{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:00:00Z","timestamp":1607731200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65621-8_11","type":"book-chapter","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T12:32:07Z","timestamp":1607689927000},"page":"175-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Complexity of Defensive and Offensive Alliances in Graphs"],"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":[[2020,12,12]]},"reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jagm.1996.0854","volume":"24","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Engelfriet, J.: Domino treewidth. J. Algorithms 24(1), 94\u2013123 (1997)","journal-title":"J. Algorithms"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.dam.2011.11.004","volume":"160","author":"C-W Chang","year":"2012","unstructured":"Chang, C.-W., Chia, M.-L., Hsu, C.-J., Kuo, D., Lai, L.-L., Wang, F.-H.: Global defensive alliances of trees and cartesian product of paths and cycles. Discret. Appl. Math. 160(4), 479\u2013487 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"11_CR4","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":"11_CR5","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":"11_CR6","unstructured":"Enciso, R.: Alliances in graphs: parameterized algorithms and on partitioning series-parallel graphs. Ph.D. thesis, USA (2009)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"key":"11_CR8","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":"11_CR9","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A., Sigarreta, J.M.: Global r-alliances and total domination. In: CTW (2008)"},{"issue":"1","key":"11_CR10","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":"11_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. Comb. Appl. 38, 37\u201341 (2003)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"11_CR12","unstructured":"Jamieson, L.H.: Algorithms and complexity for alliances and weighted alliances of various types. Ph.D. thesis, USA (2007)"},{"key":"11_CR13","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."},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"11_CR15","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":"11_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":"11_CR17","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, 19\u201337 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"11_CR20","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 Discret. Math. 25, 157\u2013164 (2006)","journal-title":"Electron. Notes Discret. Math."},{"issue":"8","key":"11_CR21","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":"11_CR22","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":"11_CR23","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":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 634\u2013645. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_52"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65621-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:23:20Z","timestamp":1607991800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65621-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,12]]},"ISBN":["9783030656201","9783030656218"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65621-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020,12,12]]},"assertion":[{"value":"12 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/17th-icdcit-2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","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":"13","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":"4","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":"13% - 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":"2.5","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)"}}]}}