A class domination coloring (also called cd-Coloring or dominated colori...
Deciding whether a diagram of a knot can be untangled with a given numbe...
We study the Independent Set (IS) problem in H-free graphs, i.e., graphs...
We develop an FPT algorithm and a kernel for the Weighted Edge Clique
Pa...
An H-free editing problem asks whether we can edit at most k edges to
ma...