An input to a conflict-free variant of a classical problem Γ Γ, called Conflict-Free Γ Γ, consists
of an instance I of Γ Γ coupled with a graph H, called the conflict graph. A solution to Conflict …

Set Cover is one of the well-known classical NP-hard problems. We study the conflict-free
version of the Set Cover problem. Here we have a universe UU, a family FF of subsets of UU …

Abstract The variant of Dominating Set known as Roman Domination has been extensively
studied in the fields of graph theory and graph algorithms. Fernau and Mann [arxiv …

In the classical covering problems, the goal is to find a subset of vertices/edges that “covers”
a specific structure of the graph. In this work, we initiate the study of the covering problems …

Graphs are one of the most fundamental data structures in computer science because they
can be used to model a wide range of problems. As a result, solving optimization problems …

The variant of DOMINATING SET known as ROMAN DOMINA-TION has been extensively
studied in the fields of graph theory and graph algorithms. Fernau and Mann [arxiv …