{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:17Z","timestamp":1758586217004,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-04700-7_8","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:30Z","timestamp":1758498330000},"page":"94-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Red-Blue Unshared Dominators"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1016\/j.ejc.2006.04.003","volume":"28","author":"B Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Scott, A.D.: On separating systems. Eur. J. Comb. 28, 1068\u20131071 (2007)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"8_CR2","first-page":"181","volume":"10","author":"\u00c9 Bonnet","year":"2019","unstructured":"Bonnet, \u00c9., Giannopoulos, P., Lampis, M.: On the parameterized complexity of red-blue points separation. J. Comp. Geom. 10(1), 181\u2013206 (2019)","journal-title":"J. Comp. Geom."},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.3934\/amc.2008.2.403","volume":"2","author":"E Charbit","year":"2008","unstructured":"Charbit, E., Charon, I., Cohen, G., Hudry, O., Lobstein, A.: Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 2(4), 403\u2013420 (2008)","journal-title":"Adv. Math. Commun."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkova, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comp. 206, 1264\u20131275 (2008)","journal-title":"Inf. Comp."},{"key":"8_CR5","unstructured":"Cordasco, G., Gargano , L., Rescigno, A.A.: (t,r)-broadcast domination in networks. In: Proceedings of ICTCS 2024. https:\/\/ceur-ws.org\/Vol-3811\/ (2024)"},{"key":"8_CR6","first-page":"100","volume":"350","author":"G Cordasco","year":"2024","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Parameterized complexity for iterated type partitions and modular-width. DAM 350, 100\u2013122 (2024)","journal-title":"DAM"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Distance vector domination. In: Proceedings of SOFSEM 2025. LNCS 15538 (2025)","DOI":"10.1007\/978-3-031-82670-2_14"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Parameterized complexity of (d,r)-domination via modular decomposition. In: Proceedings of WALCOM 2025 (2025)","DOI":"10.1007\/978-981-96-2845-2_7"},{"key":"8_CR9","unstructured":"Corneil, D., Habib, M., Paul, C., Tedder, M.: A recursive linear time modular decomposition algorithm via LexBFS. arXiv:0710.3901 [cs.DM] (2024)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00453-014-9948-7","volume":"74","author":"R Crowston","year":"2016","unstructured":"Crowston, R., Gutin, G., Jones, M., Muciaccia, G., Yeo, A.: Parameterizations of test cover with bounded test sizes. Algorithmica 74(1), 367\u2013384 (2016)","journal-title":"Algorithmica"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJ De Bontridder","year":"2003","unstructured":"De Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. Ser. B 98, 477\u2013491 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Dev, S.R., Dey, S., Foucaud, F., Klasing, R., Lehtil\u00e4, T.: The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970 (2023)","DOI":"10.1016\/j.tcs.2023.114061"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","DOI":"10.1145\/285055.285059"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Scientiarum Hung. 18, 26\u201366 (1967)","DOI":"10.1007\/BF02020961"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 163\u2013176. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_15"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","volume":"154","author":"TW Haynes","year":"2006","unstructured":"Haynes, T.W., Henning, M.A., Howard, J.: Locating and total-dominating sets in trees. Discret. Appl. Math. 154, 1293\u20131300 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. on Inf. theory 44(2), 599\u2013611 (1998)","journal-title":"IEEE Trans. on Inf. theory"},{"key":"8_CR18","unstructured":"Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs: a bibliography (2025). https:\/\/www.lri.fr\/~lobstein\/debutBIBidetlocdom.pdf"},{"key":"8_CR19","unstructured":"Lafond, M., Luo, W.: Parameterized complexity of domination problems using restricted modular partitions. MFCS 2023, 61:1\u201361:14 (2023)"},{"key":"8_CR20","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"},{"key":"8_CR21","first-page":"266","volume":"2020","author":"N Misra","year":"2020","unstructured":"Misra, N., Mittal, H., Sethia, A.: Red-blue point separation for points on a circle. Proc. CCCG 2020, 266\u2013272 (2020)","journal-title":"Proc. CCCG"},{"key":"8_CR22","unstructured":"Romanek, M.: Parameterized algorithms for modular-width. Bachelor\u2019s Thesis, (2016)"},{"key":"8_CR23","first-page":"109","volume":"46","author":"SJ Seo","year":"2010","unstructured":"Seo, S.J., Slater, P.J.: Open neighborhood locating dominating sets. Australas. J. Com. 46, 109\u2013119 (2010)","journal-title":"Australas. J. Com."},{"key":"8_CR24","first-page":"445","volume":"22","author":"PJ Slater","year":"1988","unstructured":"Slater, P.J.: Dominating and reference sets in a graph. J. Math. Phys. Sci. 22, 445\u2013455 (1988)","journal-title":"J. Math. Phys. Sci."},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/jgt.3190200313","volume":"20","author":"IE Zvervich","year":"1995","unstructured":"Zvervich, I.E., Zverovich, V.E.: An induced subgraph characterization of domination perfect graphs. J. Graph Theory 20(3), 375\u2013395 (1995)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:33Z","timestamp":1758498333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}