Graciela L. Nasini

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 14

Top Topics

Bipartite Graph

Hypergraph Model

Top Venues

Discret. Appl. Math.

Comput. Oper. Res.

Publications

Alberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente
Minimizing External Vertices in Hypergraph Orientations. ISCO (2024)
Luciana Melchiori, Graciela L. Nasini, Jorge M. Montagna, Gabriela Corsano
Resources synchronization in a full truckload pickup and delivery problem: An exact approach. Comput. Oper. Res. 151 (2023)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Katrin Wagler
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. Discret. Appl. Math. 332 (2023)
Mauro Lucci, Daniel E. Severín, Graciela L. Nasini
Solving the List Coloring Problem through a Branch-and-Price algorithm. CoRR (2023)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres
On dominating set polyhedra of circular interval graphs. Discret. Math. 344 (4) (2021)
Graciela L. Nasini, Pablo Daniel Torres
Grundy dominating sequences on X-join product. Discret. Appl. Math. 284 (2020)
Mauro Lucci, Graciela L. Nasini, Daniel Severín
A Branch and Price Algorithm for List Coloring Problem. LAGOS (2019)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres
Circuits and Circulant Minors. LAGOS (2019)
Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. Electron. Notes Discret. Math. 69 (2018)
Mauro Lucci, Graciela L. Nasini, Daniel Severín
A Branch and Price Algorithm for List Coloring Problem. CoRR (2018)
Bostjan Bresar, Tim Kos, Graciela L. Nasini, Pablo Daniel Torres
Total dominating sequences in trees, split graphs, and under modular decomposition. Discret. Optim. 28 (2018)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. Math. Program. 162 (1-2) (2017)
Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler
Characterizing N+-perfect line graphs. Int. Trans. Oper. Res. 24 (1-2) (2017)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. ISCO (2016)
Graciela L. Nasini, Daniel E. Severín, Pablo Daniel Torres
On the Packing Chromatic Number on Hamming Graphs and General Graphs. CoRR (2015)
Graciela L. Nasini, Pablo Daniel Torres
Some links between identifying codes and separating, dominating and total dominating sets in graphs. Electron. Notes Discret. Math. 50 (2015)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A DSATUR-based algorithm for the Equitable Coloring Problem. Comput. Oper. Res. 57 (2015)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
An exact DSatur-based algorithm for the Equitable Coloring Problem. CoRR (2014)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. CoRR (2014)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A Tabu Search Heuristic for the Equitable Coloring Problem. ISCO (2014)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. Discret. Appl. Math. 164 (2014)
Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres
The packing coloring problem for lobsters and partner limited graphs. Discret. Appl. Math. 164 (2014)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei
Some advances on the set covering polyhedron of circulant matrices. Discret. Appl. Math. 166 (2014)
Mariana S. Escalante, Graciela L. Nasini
Lovász and Schrijver N_+ -Relaxation on Web Graphs. ISCO (2014)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A tabu search heuristic for the Equitable Coloring Problem. CoRR (2014)
Valeria A. Leoni, Graciela L. Nasini
Limited Packing and Multiple Domination problems: Polynomial time reductions. Discret. Appl. Math. 164 (2014)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei
The minor inequalities in the description of the set covering polyhedron of circulant matrices. Math. Methods Oper. Res. 79 (1) (2014)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A polyhedral approach for the equitable coloring problem. Discret. Appl. Math. 164 (2014)
Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. Discret. Optim. 10 (1) (2013)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
An exact DSatur-based algorithm for the Equitable Coloring Problem. Electron. Notes Discret. Math. 44 (2013)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. Electron. Notes Discret. Math. 44 (2013)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A new DSATUR-based algorithm for the Equitable Coloring Problem. CoRR (2013)
Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres
The Packing Coloring Problem for (q, q-4) Graphs. ISCO (2012)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
A polyhedral approach for the Equitable Coloring Problem CoRR (2011)
Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres
Polynomial instances of the Packing Coloring Problem. Electron. Notes Discret. Math. 37 (2011)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
(G). Electron. Notes Discret. Math. 37 (2011)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
Polyhedral results for the Equitable Coloring Problem. Electron. Notes Discret. Math. 37 (2011)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini
-operator under blocker duality. Discret. Appl. Math. 159 (5) (2011)
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín
Polyhedral results for the Equitable Coloring Problem CoRR (2011)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
(⋅) relaxations of the fractional stable set polytope. Electron. Notes Discret. Math. 37 (2011)
Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini
The multiple domination and limited packing problems in graphs. Inf. Process. Lett. 111 (23-24) (2011)
Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini
Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. Electron. Notes Discret. Math. 37 (2011)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei
The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. Electron. Notes Discret. Math. 36 (2010)
Valeria A. Leoni, Graciela L. Nasini
On the computational complexity of combinatorial flexibility problems. Int. J. Comput. Math. 87 (15) (2010)
Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini
-tidy and split graphs. Electron. Notes Discret. Math. 36 (2010)
Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini
The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems. Electron. Notes Discret. Math. 36 (2010)
Valeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini
Recognizing Edge-Perfect Graphs: some Polynomial Instances. CTW (2009)
Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei
On the dominating set polytope of web graphs. Electron. Notes Discret. Math. 35 (2009)
Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini
Combinatorial flexibility problems and their computational complexity. Electron. Notes Discret. Math. 30 (2008)
Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
Some insight into characterizations of minimally nonideal matrices. Math. Methods Oper. Res. 67 (2) (2008)
Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini
Some flexibility problmes and their complexity. CTW (2007)
Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
On a certain class of nonideal clutters. Discret. Appl. Math. 154 (13) (2006)
Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini
-rank graphs: Progress on Lipták and Tunçel's conjecture. Oper. Res. Lett. 34 (6) (2006)
Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
Clutter nonidealness. Discret. Appl. Math. 154 (9) (2006)
Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo
On the commutativity of antiblocker diagrams under lift-and-project operators. Discret. Appl. Math. 154 (13) (2006)
Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
Lehman's equation on near-ideal clutters. Electron. Notes Discret. Math. 19 (2005)
Valeria A. Leoni, Graciela L. Nasini
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". Discret. Appl. Math. 150 (1-3) (2005)
Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
On a certain class of nonideal clutters. Electron. Notes Discret. Math. 18 (2004)
Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo
Note on Lift-and-Project Ranks and Antiblocker Duality. Electron. Notes Discret. Math. 18 (2004)
Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini
Lift and project relaxations for the matching and related polytopes. Discret. Appl. Math. 134 (1-3) (2004)
Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini
- rank graphs. Electron. Notes Discret. Math. 18 (2004)
Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini
The disjunctive procedure and blocker duality. Discret. Appl. Math. 121 (1-3) (2002)
Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. Math. Oper. Res. 27 (3) (2002)