2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 2 cited
Parameterized Domination in Circle Graphs
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios +3
A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set…
cs.CC2012
On Exact Algorithms for Permutation CSP
Eun Jung Kim, Daniel Goncalves
In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables and a set of constraints C, in which constraints are tuples of elements of…