54 citations · 64 across the 8 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
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…
cs.CC2010★ 54 cited
Finding and counting vertex-colored subtrees
Sylvain Guillemot, Florian Sikora
The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex…