Page
%P
-
Chapter and Conference Paper
Hitting and Covering Partially
d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial
-
Chapter and Conference Paper
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Let \(\mathrm{\Pi }\) be a family of graphs. In the classical