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…
Total dominating sequences in trees, split graphs, and under modular decomposition
Boštjan Brešar, Tim Kos, Graciela Nasini +1
A sequence of vertices in a graph with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…
On the Packing Chromatic Number on Hamming Graphs and General Graphs
Graciela Nasini, Daniel Severin, Pablo Torres
The packing chromatic number of a graph is the smallest integer needed to proper color the vertices of in such a way the distance between any two vertices havi…
Characterizing N+-perfect line graphs
M. Escalante, G. Nasini, A. Wagler
The subject of this contribution is the study of the Lovász-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly inte…
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
S. Bianchi, M. Escalante, G. Nasini +1
We study the Lovász-Schrijver lift-and-project operator () based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of gr…
A tabu search heuristic for the Equitable Coloring Problem
Isabel Méndez Díaz, Graciela Nasini, Daniel Severín
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, call…
An exact DSatur-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severín
This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifi…
The Identifying Code problem on -tidy graphs
Graciela Nasini, Pablo Torres
In this paper we first analyze the behaviour of the identifying code number under union and join operations in graphs. This study forced us to analyze three new parameters related…
A DSATUR-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based o…
The Minor inequalities in the description of the Set Covering Polyhedron of Circulant Matrices
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei
In this work we give a complete description of the set covering polyhedron of circulant matrices with and by linear inequalities. In particular, we…
Some advances on the set covering polyhedron of circulant matrices
Silvia Bianchi, Graciela Nasini, Paola Tolomei
Working on the set covering polyhedron of consecutive ones circulant matrices, Argiroffo and Bianchi found a class of facet defining inequalities, induced by a particular family of…
Polyhedral results for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and deri…
A polyhedral approach for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and deri…