{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T03:54:49Z","timestamp":1772769289002,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_7","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"96-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Parameterized Complexity of\u00a0Minus Domination"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A","family":"Mohanapriya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Purohit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-1-4419-7997-1_26","volume-title":"Handbook of Combinatorial Optimization","author":"GJ Chang","year":"2013","unstructured":"Chang, G.J.: Algorithmic aspects of domination in graphs. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 221\u2013282. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_26"},{"key":"7_CR2","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"},{"issue":"1","key":"7_CR3","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. Discrete Appl. Math. 108(1), 53\u201364 (2001). Workshop on Graph Theoretic Concepts in Computer Science","journal-title":"Discrete Appl. Math."},{"key":"7_CR4","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/s00453-016-0127-x","volume":"76","author":"PG Drange","year":"2016","unstructured":"Drange, P.G., Dregi, M., van \u2019t Hof, P.: On the computational complexity of vertex integrity and component order connectivity. Algorithmica 76(4), 1181\u20131202 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0127-x","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","volume":"68","author":"J Dunbar","year":"1996","unstructured":"Dunbar, J., Goddard, W., Hedetniemi, S., McRae, A., Henning, M.A.: The algorithmic complexity of minus domination in graphs. Discrete Appl. Math. 68(1), 73\u201384 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(94)00329-H","volume":"149","author":"J Dunbar","year":"1996","unstructured":"Dunbar, J., Hedetniemi, S., Henning, M.A., McRae, A.A.: Minus domination in regular graphs. Discrete Math. 149(1), 311\u2013312 (1996)","journal-title":"Discrete Math."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disopt.2016.04.002","volume":"22","author":"L Faria","year":"2016","unstructured":"Faria, L., Hon, W.-K., Kloks, T., Liu, H.-H., Wang, T.-M., Wang, Y.-L.: On complexities of minus domination. Discrete Optim. 22, 6\u201319 (2016). SI: ISCO 2014","journal-title":"Discrete Optim."},{"issue":"7","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.tcs.2009.11.012","volume":"411","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S.: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7), 1045\u20131053 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-28050-4_21","volume-title":"Parameterized and Exact Computation","author":"R Ganian","year":"2012","unstructured":"Ganian, R.: Twin-cover: beyond vertex cover in parameterized algorithmics. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 259\u2013271. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28050-4_21"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-90530-3_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Goyal","year":"2018","unstructured":"Goyal, D., Jacob, A., Kumar, K., Majumdar, D., Raman, V.: Structural parameterizations of\u00a0dominating set variants. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 157\u2013168. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_14"},{"key":"7_CR12","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","volume":"86","author":"ST Hedetniemi","year":"1990","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math. 86(1), 257\u2013277 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010). https:\/\/doi.org\/10.1007\/s00224-008-9150-x","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"7_CR15","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."},{"issue":"1","key":"7_CR16","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(1), 19\u201337 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9554-x","journal-title":"Algorithmica"},{"issue":"18","key":"7_CR17","doi-asserted-by":"publisher","first-page":"4185","DOI":"10.1016\/j.disc.2007.08.080","volume":"308","author":"C-M 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":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-21398-9_27","volume-title":"Computing and Combinatorics","author":"J-Y Lin","year":"2015","unstructured":"Lin, J.-Y., Liu, C.-H., Poon, S.-H.: Algorithmic aspect of minus domination on small-degree graphs. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 337\u2013348. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_27"},{"key":"7_CR19","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","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:03:21Z","timestamp":1711569801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","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":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}