115 citations · 178 across the 20 of their papers we have counts for
3 papers · 1 filter
On independent set on B1-EPG graphs
Marin Bougeret, Stephane Bessy, Daniel Gonçalves +1
In this paper we consider the Maximum Independent Set problem (MIS) on -EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in ~\cite{edgeintersin…
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim +4
The Outerplanar Diameter Improvement problem asks, given a graph and an integer , whether it is possible to add edges to in a way that the resulting graph is outerplanar…
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…