{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T23:03:46Z","timestamp":1784070226239,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819233083","type":"print"},{"value":"9789819233090","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-3309-0_13","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:00Z","timestamp":1784066880000},"page":"163-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Complexity of\u00a0Odd Domination and\u00a0its Generalization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3464-1213","authenticated-orcid":false,"given":"Toranosuke","family":"Kokai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3953-4339","authenticated-orcid":false,"given":"Rin","family":"Saito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1376-4678","authenticated-orcid":false,"given":"Tatsuhiro","family":"Suga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8433-3789","authenticated-orcid":false,"given":"Takahiro","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5479-7006","authenticated-orcid":false,"given":"Yuma","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/S00453-008-9204-0","volume":"54","author":"N Alon","year":"2009","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544\u2013556 (2009). https:\/\/doi.org\/10.1007\/S00453-008-9204-0","journal-title":"Algorithmica"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, M., Feil, T.: Turning lights out with linear algebra. Math. Mag. 71(4), 300\u2013303 (1998). http:\/\/www.jstor.org\/stable\/2690705","DOI":"10.1080\/0025570X.1998.11996658"},{"key":"13_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2025.115573","volume":"1059","author":"V Blazej","year":"2026","unstructured":"Blazej, V., Jana, S., Strulo, P.: A parameterized perspective of All-Colors. Theor. Comput. Sci. 1059, 115573 (2026). https:\/\/doi.org\/10.1016\/J.TCS.2025.115573","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277\u2013305 (2014). https:\/\/doi.org\/10.1137\/120880240","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"13_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/J.TCS.2007.05.027","volume":"385","author":"H Broersma","year":"2007","unstructured":"Broersma, H., Li, X.: On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1\u20133), 60\u201370 (2007). https:\/\/doi.org\/10.1016\/J.TCS.2007.05.027","journal-title":"Theor. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/J.TCS.2013.01.009","volume":"511","author":"B Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theor. Comput. Sci. 511, 66\u201376 (2013). https:\/\/doi.org\/10.1016\/J.TCS.2013.01.009","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006. Lecture Notes in Computer Science, vol.\u00a04169, pp. 239\u2013250. Springer (2006). https:\/\/doi.org\/10.1007\/11847250_22","DOI":"10.1007\/11847250_22"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and ids. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014). https:\/\/doi.org\/10.1145\/2650261","DOI":"10.1145\/2650261"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Fleischer, R., Yu, J.: A survey of the game \u201clights out!\u201d. In: Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Lecture Notes in Computer Science, vol.\u00a08066, pp. 176\u2013198. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_13","DOI":"10.1007\/978-3-642-40273-9_13"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Focke, J., et al.: Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs - part I: algorithmic results. ACM Trans. Algorithms 21(3), 27:1\u201327:45 (2025). https:\/\/doi.org\/10.1145\/3731452","DOI":"10.1145\/3731452"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Focke, J., et al.: Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs part II: hardness results. ACM Trans. Comput. Theory 17(2), 10:1\u201310:101 (2025). https:\/\/doi.org\/10.1145\/3708509","DOI":"10.1145\/3708509"},{"issue":"2\u20133","key":"13_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/S00607-008-0005-8","volume":"82","author":"E Gassner","year":"2008","unstructured":"Gassner, E., Hatzl, J.: A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. Computing 82(2\u20133), 171\u2013187 (2008). https:\/\/doi.org\/10.1007\/S00607-008-0005-8","journal-title":"Computing"},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/J.DAM.2010.11.012","volume":"160","author":"PA Golovach","year":"2012","unstructured":"Golovach, P.A., Kratochv\u00edl, J., Such\u00fd, O.: Parameterized complexity of generalized domination problems. Discret. Appl. Math. 160(6), 780\u2013792 (2012). https:\/\/doi.org\/10.1016\/J.DAM.2010.11.012","journal-title":"Discret. Appl. Math."},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Greilhuber, J., Schepper, P., Wellnitz, P.: Residue domination in bounded-treewidth graphs. In: 42nd International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol.\u00a0327, pp. 41:1\u201341:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2025.41","DOI":"10.4230\/LIPICS.STACS.2025.41"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Grohe, M., Kreutzer, S., Siebertz, S.: Deciding first-order properties of nowhere dense graphs. J. ACM 64(3), 17:1\u201317:32 (2017). https:\/\/doi.org\/10.1145\/3051095","DOI":"10.1145\/3051095"},{"issue":"24","key":"13_CR17","doi-asserted-by":"publisher","first-page":"6355","DOI":"10.1016\/J.DISC.2007.12.005","volume":"308","author":"J Hatzl","year":"2008","unstructured":"Hatzl, J., Wagner, S.G.: Combinatorial properties of a general domination problem with parity constraints. Discret. Math. 308(24), 6355\u20136367 (2008). https:\/\/doi.org\/10.1016\/J.DISC.2007.12.005","journal-title":"Discret. Math."},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Jaffke, L., Kwon, O., Str\u00f8mme, T.J.F., Telle, J.A.: Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216\u2013236 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2019.09.012","DOI":"10.1016\/J.TCS.2019.09.012"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.4086\/TOC.2010.V006A005","volume":"6","author":"D Marx","year":"2010","unstructured":"Marx, D.: Can you beat treewidth? Theory Comput. 6(1), 85\u2013112 (2010). https:\/\/doi.org\/10.4086\/TOC.2010.V006A005","journal-title":"Theory Comput."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Jaffke, L., Kwon, O., Str\u00f8mme, T.J.F., Telle, J.A.: Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796, 216\u2013236 (2019). https:\/\/doi.org\/10.1016\/J.TCS.2019.09.012","DOI":"10.1016\/J.TCS.2019.09.012"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/S00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discret. Comput. Geom. 26(4), 573\u2013590 (2001). https:\/\/doi.org\/10.1007\/S00454-001-0047-6","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/J.EJC.2011.01.006","volume":"32","author":"J Nesetril","year":"2011","unstructured":"Nesetril, J., de Mendez, P.O.: On nowhere dense graphs. Eur. J. Comb. 32(4), 600\u2013617 (2011). https:\/\/doi.org\/10.1016\/J.EJC.2011.01.006","journal-title":"Eur. J. Comb."},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"van Rooij, J.M.M., Bodlaender, H.L., Rossmanith, P.: Dynamic programming on tree decompositions using generalised fast subset convolution. In: Fiat, A., Sanders, P. (eds.) Algorithms - ESA 2009, 17th Annual European Symposium. Lecture Notes in Computer Science, vol.\u00a05757, pp. 566\u2013577. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_51","DOI":"10.1007\/978-3-642-04128-0_51"},{"key":"13_CR24","unstructured":"Sutner, K.: Additive automata on graphs. Complex Syst. 2(6) (1988). http:\/\/www.complex-systems.com\/abstracts\/v02_i06_a03.html"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Sutner, K.: The $$\\sigma $$-game and cellular automata. Am. Math. Monthly 97(1), 24\u201334 (1990). http:\/\/www.jstor.org\/stable\/2323999","DOI":"10.1080\/00029890.1990.11995540"},{"issue":"1","key":"13_CR26","first-page":"157","volume":"1","author":"JA Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nord. J. Comput. 1(1), 157\u2013171 (1994)","journal-title":"Nord. J. Comput."},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Telle, J.A., Proskurowski, A.: Practical algorithms on partial $$k$$-trees with an application to domination-like problems. In: Algorithms and Data Structures, Third Workshop, WADS \u201993. Lecture Notes in Computer Science, vol.\u00a0709, pp. 610\u2013621. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57155-8_284","DOI":"10.1007\/3-540-57155-8_284"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, X., Wang, C.: Solutions to all-colors problem on graph cellular automata. Complex. 2019, 3164692:1\u20133164692:11 (2019). https:\/\/doi.org\/10.1155\/2019\/3164692","DOI":"10.1155\/2019\/3164692"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3309-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:02Z","timestamp":1784066882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3309-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819233083","9789819233090"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3309-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"23 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.ntu.edu.sg\/cocoon2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}