{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:10Z","timestamp":1759639090035,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_21","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"285-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Red-Blue Separation Problem on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Subhadeep Ranjan","family":"Dev","sequence":"first","affiliation":[]},{"given":"Sanjana","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Florent","family":"Foucaud","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Tuomo","family":"Lehtil\u00e4","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"21_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":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0095-8956(72)90025-1","volume":"12","author":"JA Bondy","year":"1972","unstructured":"Bondy, J.A.: Induced subsets. J. Comb. Theory Ser. B 12(2), 201\u2013202 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"21_CR3","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. Comput. Geom. 10(1), 181\u2013206 (2019)","journal-title":"J. Comput. Geom."},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1137\/14097879X","volume":"29","author":"N Bousquet","year":"2015","unstructured":"Bousquet, N., Lagoutte, A., Li, Z., Parreau, A., Thomass\u00e9, S.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM J. Discret. Math. 29(4), 2047\u20132064 (2015)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0218195905001865","volume":"15","author":"G C\u01celinescu","year":"2005","unstructured":"C\u01celinescu, G., Dumitrescu, A., Karloff, H.J., Wan, P.: Separating points by axis-parallel lines. Int. J. Comput. Geom. Appl. 15(6), 575\u2013590 (2005)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"21_CR6","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":"21_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-69115-4_74","volume-title":"Rough Sets and Current Trends in Computing","author":"BS Chlebus","year":"1998","unstructured":"Chlebus, B.S., Nguyen, S.H.: On finding optimal discretizations for two attributes. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 537\u2013544. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69115-4_74"},{"issue":"1","key":"21_CR8","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":"21_CR9","unstructured":"Dey, S., Foucaud, F., Nandy, S.C., Sen, A.: Discriminating codes in geometric setups. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics, vol. 181, pp. 24:1\u201324:16 (2020)"},{"key":"21_CR10","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., et al.: Approximation algorithms for the test cover problem. Math. Program. Ser. B 98, 477\u2013491 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: ACM Symposium on Theory of Computing, vol. 46, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"21_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BFb0072626","volume-title":"Measure Theory Oberwolfach 1983","author":"P Erd\u00f6s","year":"1984","unstructured":"Erd\u00f6s, P.: Some combinatorial, geometric and set theoretic problems in measure theory. In: K\u00f6lzow, D., Maharam-Stone, D. (eds.) Measure Theory Oberwolfach 1983. LNM, vol. 1089, pp. 321\u2013327. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0072626"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.ejc.2011.01.002","volume":"32","author":"F Foucaud","year":"2011","unstructured":"Foucaud, F., Guerrini, E., Kov\u0161e, M., Naserasr, R., Parreau, A., Valicov, P.: Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4), 628\u2013638 (2011)","journal-title":"Eur. J. Comb."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.disc.2018.10.002","volume":"342","author":"V Gledel","year":"2019","unstructured":"Gledel, V., Parreau, A.: Identification of points using disks. Discret. Math. 342, 256\u2013269 (2019)","journal-title":"Discret. Math."},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s00454-019-00103-z","volume":"63","author":"S Har-Peled","year":"2020","unstructured":"Har-Peled, S., Jones, M.: On separating points by lines. Discret. Comput. Geom. 63, 705\u2013730 (2020)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s00373-013-1311-2","volume":"30","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Yeo, A.: Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs. Graphs Comb. 30(4), 909\u2013932 (2014)","journal-title":"Graphs Comb."},{"key":"21_CR18","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. Inf. Theory 44, 599\u2013611 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Masa\u0159\u00edk, T., Muzi, I., Pilipczuk, M., Sorge, M.: Optimal discretization is fixed-parameter tractable. In: Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), pp. 1702\u20131719 (2021)","DOI":"10.1137\/1.9781611976465.103"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-74976-9_20","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"J Kujala","year":"2007","unstructured":"Kujala, J., Elomaa, T.: Improved algorithms for univariate discretization of continuous features. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 188\u2013199. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74976-9_20"},{"key":"21_CR21","unstructured":"Lobstein, A.: Watching systems, identifying, locating-dominating and discriminating codes in graphs: a bibliography. https:\/\/www.lri.fr\/~lobstein\/debutBIBidetlocdom.pdf"},{"key":"21_CR22","unstructured":"Misra, N., Mittal, H., Sethia, A.: Red-blue point separation for points on a circle. In: Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG 2020), pp. 266\u2013272 (2020)"},{"issue":"4","key":"21_CR23","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"BME Moret","year":"1985","unstructured":"Moret, B.M.E., Shapiro, H.D.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983\u20131003 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"21_CR24","first-page":"75","volume":"22","author":"A R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On random generating elements of a finite Boolean algebra. Acta Scientiarum Mathematicarum Szeged 22, 75\u201381 (1961)","journal-title":"Acta Scientiarum Mathematicarum Szeged"},{"issue":"1","key":"21_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discret. Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discret. Appl. Math."},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-30179-0_16","volume-title":"Intelligence in Communication Systems","author":"R Ungrangsi","year":"2004","unstructured":"Ungrangsi, R., Trachtenberg, A., Starobinski, D.: An implementation of indoor location detection systems based on identifying codes. In: Aagesen, F.A., Anutariya, C., Wuwongse, V. (eds.) INTELLCOMM 2004. LNCS, vol. 3283, pp. 175\u2013189. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30179-0_16"},{"issue":"2","key":"21_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"issue":"3","key":"21_CR28","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","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:20Z","timestamp":1653779240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","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":"Trier","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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","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":"10","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)"}}]}}