115 citations · 178 across the 20 of their papers we have counts for
5 papers · 1 filter
Locally identifying coloring in bounded expansion classes of graphs
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct. The lid-c…
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…
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…
Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations
Daniel Gonçalves, Benjamin Lévêque
A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a generalization of Schnyder woods to graphs embedded on…
The Maximum Clique Problem in Multiple Interval Graphs
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of…