23 citations · 73 across the 16 of their papers we have counts for
18 papers
Solving the List Coloring Problem through a Branch-and-Price algorithm
Mauro Lucci, Daniel Severin, Graciela Nasini
In this work, we present a branch-and-price algorithm to solve the weighted version of the List Coloring Problem, based on a vertex cover formulation by stable sets. This problem i…
Circuits and circulant minors
Silvia Bianchi, Graciela Nasini, Paola Tolomei +1
Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficien…
A Branch and Price Algorithm for List Coloring Problem
Mauro Lucci, Graciela Nasini, Daniel Severín
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem fo…
Grundy dominating sequences on -join product
Graciela Nasini, Pablo Torres
In this paper we study the Grundy domination number on the -join product of a graph and a family of graphs . The…
On dominating set polyhedra of circular interval graphs
Silvia Bianchi, Graciela Nasini, Paola Tolomei +1
Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefor…
Lovász-Schrijver PSD-operator on Claw-Free Graphs
Silvia Bianchi, Mariana Escalante, Graciela Nasini +1
The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lovász-Schr…