{'fraction_non_alphanumeric': 0.027751196172248804, 'fraction_numerical': 0.0009569377990430622, 'mean_word_length': 4.843575418994414, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Parameterized Red-Blue Geometric Covers

Given a finite set of blue points and a finite set of red points on a plane, we define the Red-Blue Geometric Cover problem as the problem of finding the minimum number of specific geometrical objects that can cover all blue points, but none of the red points. We note that Red-Blue Geometric Cover is closely related to several optimization problems studied earlier. These include Set Cover, Dominating Set, and Unit Disk Cover. In this work, we will study the parameterized complexities of variations of Red-Blue Geometric Cover under several restrictions and parameters. We will prove that this problem, parameterized by the size of the solution and the Common Appearance Index (defined later), is fixed-parameter tractable. We also show that for restrictions, such as planarity of the graph representation of the problem or having a bounded Appearance Index (defined later), this problem is fixed-parameter tractable. However, in the general case we can only prove that this problem is in class W[2].