{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:05Z","timestamp":1780783145247,"version":"3.54.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","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-27732-9_34","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:16Z","timestamp":1780780516000},"page":"486-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity of\u00a0Signed Domination"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5848-3821","authenticated-orcid":false,"given":"Sangam Balchandar","family":"Reddy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","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.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"issue":"1\u20132","key":"34_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(00)00219-5","volume":"108","author":"P Damaschke","year":"2001","unstructured":"Damaschke, P.: Minus domination in small-degree graphs. Discret. Appl. Math. 108(1\u20132), 53\u201364 (2001)","journal-title":"Discret. Appl. Math."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Dunbar, J., Hedetniemi, S., Henning, M., Slater, P.: Signed domination in graphs. graph theory, combinatorics, and applications. John Wiley & Sons, Inc. 1, 311\u2013322 (1995)","DOI":"10.1016\/0012-365X(94)00329-H"},{"issue":"1\u20133","key":"34_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(96)00026-X","volume":"158","author":"O Favaron","year":"1996","unstructured":"Favaron, O.: Signed domination in regular graphs. Discret. Math. 158(1\u20133), 287\u2013293 (1996)","journal-title":"Discret. Math."},{"key":"34_CR5","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"},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00453-020-00758-8","volume":"83","author":"R Ganian","year":"2021","unstructured":"Ganian, R., Klute, F., Ordyniak, S.: On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica 83(1), 297\u2013336 (2021)","journal-title":"Algorithmica"},{"key":"34_CR7","first-page":"101","volume":"12","author":"JH Hattingh","year":"1995","unstructured":"Hattingh, J.H., Henning, M.A., Slater, P.J.: The algorithmic complexity of signed domination in graphs. Australas. J. Comb. 12, 101\u2013112 (1995)","journal-title":"Australas. J. Comb."},{"issue":"1\u20133","key":"34_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(96)00025-8","volume":"158","author":"MA Henning","year":"1996","unstructured":"Henning, M.A., Slater, P.J.: Inequalities relating domination parameters in cubic graphs. Discret. Math. 158(1\u20133), 87\u201398 (1996)","journal-title":"Discret. Math."},{"key":"34_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. Springer, US, Boston, MA (1972)"},{"key":"34_CR10","first-page":"443","volume":"6","author":"T Kikuno","year":"1980","unstructured":"Kikuno, T., Yoshida, N., Kakuda, Y.: The np-completeness of the dominating set problem in cubic planer graphs. IEICE Trans. 6, 443\u2013444 (1980)","journal-title":"IEICE Trans."},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"37","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, 37\u201364 (2012)","journal-title":"Algorithmica"},{"issue":"18","key":"34_CR12","doi-asserted-by":"publisher","first-page":"4185","DOI":"10.1016\/j.disc.2007.08.080","volume":"308","author":"CM Lee","year":"2008","unstructured":"Lee, C.M., Chang, M.S.: Variations of y-dominating functions on graphs. Discret. Math. 308(18), 4185\u20134204 (2008)","journal-title":"Discret. Math."},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-17142-5_38","volume-title":"Theory and Applications of Models of Computation","author":"J-Y Lin","year":"2015","unstructured":"Lin, J.-Y., Poon, S.-H.: Algorithms and Hardness for Signed Domination. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 453\u2013464. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_38"},{"key":"34_CR14","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2015","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson, Chennai (2015)","edition":"2"},{"issue":"1\u20133","key":"34_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0012-365X(98)00189-7","volume":"195","author":"Z Zhang","year":"1999","unstructured":"Zhang, Z., Xu, B., Li, Y., Liu, L.: A note on the lower bounds of signed domination number of a graph. Discret. Math. 195(1\u20133), 295\u2013298 (1999)","journal-title":"Discret. Math."},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-38756-2_27","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y Zheng","year":"2013","unstructured":"Zheng, Y., Wang, J., Feng, Q.: Kernelization and Lower Bounds of the Signed Domination Problem. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM\/FAW -2013. LNCS, vol. 7924, pp. 261\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38756-2_27"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:18Z","timestamp":1780780518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_34","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":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}