7 citations · 10 across the 5 of their papers we have counts for
5 papers
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…
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…
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 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…