{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:04:10Z","timestamp":1747541050838,"version":"3.40.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_15","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:23Z","timestamp":1747468043000},"page":"222-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Parameterized Perspective of\u00a0All-Colors"],"prefix":"10.1007","author":[{"given":"V\u00e1clav","family":"Bla\u017eej","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyabrata","family":"Jana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Strulo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"15_CR1","unstructured":"Amin, A.T., Slater, P.J.: Neighborhood domination with parity restrictions in graphs. Congressus Numerantium, 19\u201319 (1992)"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Barua, R., Ramakrishnan, S.: Sigma-game, sigma+-game, and two-dimensional additive cellular automata. Theor. Comput. Sci., 154(2), 349\u2013366 (1996). https:\/\/doi.org\/10.1016\/0304-3975(95)00091-7","DOI":"10.1016\/0304-3975(95)00091-7"},{"key":"15_CR3","unstructured":"Bekos, M.A., Lozzo, G.D., Hlin\u011bn\u00fd, P., Kaufmann, M.: Graph product structure for h-framed graphs. In ISAAC. LIPIcs, vol. 248, pp. 23:1\u201323:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"1\u20133","key":"15_CR4","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."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.7151\/dmgt.1137","volume":"21","author":"Y Caro","year":"2001","unstructured":"Caro, Y., Klostermeyer, W., Goldwasser, J.: Odd and residue domination numbers of a graph. Discussiones Mathematicae Graph Theory 21(1), 119\u2013136 (2001)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"15_CR6","first-page":"65","volume":"44","author":"Y Caro","year":"2003","unstructured":"Caro, Y., Klostermeyer, W.F.: The odd domination number of a graph. J. Comb. Math. Comb. Comput. 44, 65\u201384 (2003)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/J.ENDM.2004.03.018","volume":"17","author":"W Chen","year":"2004","unstructured":"Chen, W., Li, X., Wang, C., Zhang, X.: Linear time algorithms to the minimum all-ones problem for unicyclic and bicyclic graphs. Electron. Notes Discret. Math. 17, 93\u201398 (2004). https:\/\/doi.org\/10.1016\/J.ENDM.2004.03.018","journal-title":"Electron. Notes Discret. Math."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/S0097539703421620","volume":"33","author":"W Chen","year":"2004","unstructured":"Chen, W., Li, X., Wang, C., Zhang, X.: The minimum all-ones problem for trees. SIAM J. Comput. 33(2), 379\u2013392 (2004). https:\/\/doi.org\/10.1137\/S0097539703421620","journal-title":"SIAM J. Comput."},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. 101(1), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5","DOI":"10.1016\/S0166-218X(99)00184-5"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5","journal-title":"Discret. Appl. Math."},{"key":"15_CR12","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)"},{"issue":"2\u20133","key":"15_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1006\/aama.2001.0739","volume":"27","author":"H Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Sj\u00f6strand, J.: Note on the lamp lighting problem. Adv. Appl. Math. 27(2\u20133), 357\u2013366 (2001)","journal-title":"Adv. Appl. Math."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Fleischer, R., Yu, J.: A survey of the game \u201clights out!\u201d. Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday, pp. 176\u2013198 (2013)","DOI":"10.1007\/978-3-642-40273-9_13"},{"issue":"2","key":"15_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF03023820","volume":"11","author":"F Galvin","year":"1989","unstructured":"Galvin, F.: Solution to problem 88\u20138. Math. Intelligencer 11(2), 31\u201332 (1989)","journal-title":"Math. Intelligencer"},{"key":"15_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"15_CR17","unstructured":"Goldwasser, J., Klostermeyer, W.: Maximization versions of \u201clights out\u201d games in grids and graphs. Congressus Numerantium, 99\u2013112 (1997)"},{"key":"15_CR18","unstructured":"Hlinen\u00fd, P., Jedelsk\u00fd, J.: Twin-width of planar graphs is at most 8. CoRR, abs\/2210.08620 (2022)"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Korhonen, T.: A single-exponential time 2-approximation algorithm for treewidth. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 184\u2013192. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00026","DOI":"10.1109\/FOCS52979.2021.00026"},{"issue":"10","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1016\/J.DAM.2007.08.042","volume":"156","author":"X Li","year":"2008","unstructured":"Li, X., Wang, C., Zhang, X.: The general sigma all-ones problem for trees. Discret. Appl. Math. 156(10), 1790\u20131801 (2008). https:\/\/doi.org\/10.1016\/J.DAM.2007.08.042","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"15_CR21","doi-asserted-by":"crossref","first-page":"806","DOI":"10.2307\/2324800","volume":"100","author":"OP Lossers","year":"1993","unstructured":"Lossers, O.P.: Solution to problem 10197 [1992, 162]-an all-ones problem. Amer. Math. Monthly 100(8), 806\u2013807 (1993)","journal-title":"Amer. Math. Monthly"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-73556-4_35","volume-title":"Combinatorial Optimization and Applications","author":"Y Lu","year":"2007","unstructured":"Lu, Y., Li, Y.: The minimum all-ones problem for graphs with small treewidth. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 335\u2013342. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_35"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Manuel, P., Rajasingh, I., Rajan, B., Prabha, R.: The all-ones problem for binomial trees, butterfly and benes networks. Int. J. Math. Soft Comput. 2(2), 1\u20136 (2012)","DOI":"10.26708\/IJMSC.2012.2.2.01"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Marx, D.: Can you beat treewidth? 6(5), 85\u2013112. https:\/\/doi.org\/10.4086\/toc.2010.v006a005","DOI":"10.4086\/toc.2010.v006a005"},{"issue":"2","key":"15_CR25","first-page":"162","volume":"99","author":"U Peled","year":"1992","unstructured":"Peled, U.: Problem 10197. Amer. Math. Monthly 99(2), 162 (1992)","journal-title":"Amer. Math. Monthly"},{"key":"15_CR26","unstructured":"Sutner, K.: Problem 88-8. Math. Intelligencer 10 (1988)"},{"issue":"6","key":"15_CR27","first-page":"649","volume":"2","author":"K Sutner","year":"1988","unstructured":"Sutner, K.: Additive automata on graphs. Complex Syst. 2(6), 649\u2013661 (1988)","journal-title":"Complex Syst."},{"issue":"1","key":"15_CR28","first-page":"1","volume":"2","author":"K Sutner","year":"1988","unstructured":"Sutner, K.: On $$\\sigma $$-automata. Complex Syst. 2(1), 1\u201328 (1988)","journal-title":"Complex Syst."},{"issue":"2","key":"15_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03023823","volume":"11","author":"K Sutner","year":"1989","unstructured":"Sutner, K.: Linear cellular automata and the garden-of-eden. Math. Intelligencer 11(2), 49\u201353 (1989). https:\/\/doi.org\/10.1007\/BF03023823","journal-title":"Math. Intelligencer"},{"issue":"1","key":"15_CR30","first-page":"24","volume":"97","author":"K Sutner","year":"1990","unstructured":"Sutner, K.: The $$\\sigma $$-game and cellular automata. Am. Math. Mon. 97(1), 24\u201334 (1990)","journal-title":"Am. Math. Mon."},{"issue":"1\u20132","key":"15_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0304-3975(97)00242-9","volume":"230","author":"K Sutner","year":"2000","unstructured":"Sutner, K.: sigma-automata and chebyshev-polynomials. Theor. Comput. Sci. 230(1\u20132), 49\u201373 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(97)00242-9","journal-title":"Theor. Comput. Sci."},{"key":"15_CR32","doi-asserted-by":"publisher","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","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:29Z","timestamp":1747468049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}