1 citations · 1 across the 2 of their papers we have counts for
3 papers · 1 filter
Squares of Low Maximum Degree
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach +3
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of decid…
Faster algorithms to enumerate hypergraph transversals
Manfred Cochefert, Jean-Francois Couturier, Serge Gaspers +1
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversal…
Parameterized Algorithms for Finding Square Roots
Manfred Cochefert, Jean-François Couturier, Petr A. Golovach +2
We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k…