16 citations · 97 across the 26 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Complexity Dichotomies for the Minimum F-Overlay Problem
Nathann Cohen, Frédéric Havet, Dorian Mazauric +2
For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of…
cs.DS2010★ 5 cited
On the (non-)existence of polynomial kernels for Pl-free edge modification problems
Sylvain Guillemot, Christophe Paul, Anthony Perez
Given a graph G = (V,E) and an integer k, an edge modification problem for a graph property P consists in deciding whether there exists a set of edges F of size at most k such that…