The disjunctive procedure and blocker duality. - Néstor E. Aguilera; Mariana S. Escalante; Graciela L. Nasini (Discret. Appl. Math., 2002)

A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. - Néstor E. Aguilera; Mariana S. Escalante; Graciela L. Nasini (Math. Oper. Res., 2002)

Lift and project relaxations for the matching and related polytopes. - Néstor E. Aguilera; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2004)

On minimal N+- rank graphs. - Mariana S. Escalante; M. S. Montelar; Graciela L. Nasini (Electron. Notes Discret. Math., 2004)

Note on Lift-and-Project Ranks and Antiblocker Duality. - Mariana S. Escalante; Graciela L. Nasini; María del Carmen Varaldo (Electron. Notes Discret. Math., 2004)

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". - Valeria A. Leoni; Graciela L. Nasini (Discret. Appl. Math., 2005)

Lehman's equation on near-ideal clutters. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Electron. Notes Discret. Math., 2005)

Clutter nonidealness. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2006)

On a certain class of nonideal clutters. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2006)

On the commutativity of antiblocker diagrams under lift-and-project operators. - Mariana S. Escalante; Graciela L. Nasini; María del Carmen Varaldo (Discret. Appl. Math., 2006)

Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture. - Mariana S. Escalante; M. S. Montelar; Graciela L. Nasini (Oper. Res. Lett., 2006)

Some flexibility problmes and their complexity. - Néstor E. Aguilera; Valeria A. Leoni; Graciela L. Nasini (CTW, 2007)

Combinatorial flexibility problems and their computational complexity. - Néstor E. Aguilera; Valeria A. Leoni; Graciela L. Nasini (Electron. Notes Discret. Math., 2008)

Some insight into characterizations of minimally nonideal matrices. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Math. Methods Oper. Res., 2008)

Recognizing Edge-Perfect Graphs: some Polynomial Instances. - Valeria A. Leoni; Maria Patricia Dobson; Graciela L. Nasini (CTW, 2009)

On the dominating set polytope of web graphs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Electron. Notes Discret. Math., 2009)

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Electron. Notes Discret. Math., 2010)

The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems. - Maria Patricia Dobson; Valeria A. Leoni; Graciela L. Nasini (Electron. Notes Discret. Math., 2010)

The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs. - Maria Patricia Dobson; Valeria A. Leoni; Graciela L. Nasini (Electron. Notes Discret. Math., 2010)

On the computational complexity of combinatorial flexibility problems. - Valeria A. Leoni; Graciela L. Nasini (Int. J. Comput. Math., 2010)

On the behavior of the N+-operator under blocker duality. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini (Discret. Appl. Math., 2011)

Polynomial instances of the Packing Coloring Problem. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (Electron. Notes Discret. Math., 2011)

Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Near-perfect graphs with polyhedral N+(G). - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. - Maria Patricia Dobson; Valeria A. Leoni; Graciela L. Nasini (Electron. Notes Discret. Math., 2011)

Polyhedral results for the Equitable Coloring Problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (Electron. Notes Discret. Math., 2011)

The multiple domination and limited packing problems in graphs. - Maria Patricia Dobson; Valeria A. Leoni; Graciela L. Nasini (Inf. Process. Lett., 2011)

The Packing Coloring Problem for (q, q-4) Graphs. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (ISCO, 2012)

A new DSATUR-based algorithm for the Equitable Coloring Problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (CoRR, 2013)

A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. - Maria Patricia Dobson; Valeria A. Leoni; Graciela L. Nasini (Discret. Optim., 2013)

Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2013)

An exact DSatur-based algorithm for the Equitable Coloring Problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (Electron. Notes Discret. Math., 2013)

Lovász and Schrijver N_+ -Relaxation on Web Graphs. - Mariana S. Escalante; Graciela L. Nasini (ISCO, 2014)

A Tabu Search Heuristic for the Equitable Coloring Problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (ISCO, 2014)

The packing coloring problem for lobsters and partner limited graphs. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (Discret. Appl. Math., 2014)

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Discret. Appl. Math., 2014)

Some advances on the set covering polyhedron of circulant matrices. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Discret. Appl. Math., 2014)

Limited Packing and Multiple Domination problems: Polynomial time reductions. - Valeria A. Leoni; Graciela L. Nasini (Discret. Appl. Math., 2014)

A polyhedral approach for the equitable coloring problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (Discret. Appl. Math., 2014)

The minor inequalities in the description of the set covering polyhedron of circulant matrices. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Math. Methods Oper. Res., 2014)

A DSATUR-based algorithm for the Equitable Coloring Problem. - Isabel Méndez-Díaz; Graciela L. Nasini; Daniel E. Severín (Comput. Oper. Res., 2015)

On the Packing Chromatic Number on Hamming Graphs and General Graphs. - Graciela L. Nasini; Daniel E. Severín; Pablo Daniel Torres (CoRR, 2015)

Some links between identifying codes and separating, dominating and total dominating sets in graphs. - Graciela L. Nasini; Pablo Daniel Torres (Electron. Notes Discret. Math., 2015)

Lovász-Schrijver PSD-Operator on Claw-Free Graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Wagler (ISCO, 2016)

Characterizing N+-perfect line graphs. - Mariana S. Escalante; Graciela L. Nasini; Annegret Wagler (Int. Trans. Oper. Res., 2017)

Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Math. Program., 2017)

Total dominating sequences in trees, split graphs, and under modular decomposition. - Bostjan Bresar; Tim Kos; Graciela L. Nasini; Pablo Daniel Torres (Discret. Optim., 2018)

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices. - Graciela L. Nasini; Luis Miguel Torres; Hervé Kerivin; Annegret Wagler (Electron. Notes Discret. Math., 2018)

Circuits and Circulant Minors. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei; Luis Miguel Torres (LAGOS, 2019)

A Branch and Price Algorithm for List Coloring Problem. - Mauro Lucci; Graciela L. Nasini; Daniel Severín 001 (LAGOS, 2019)

Grundy dominating sequences on X-join product. - Graciela L. Nasini; Pablo Daniel Torres (Discret. Appl. Math., 2020)

On dominating set polyhedra of circular interval graphs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei; Luis Miguel Torres (Discret. Math., 2021)

Resources synchronization in a full truckload pickup and delivery problem: An exact approach. - Luciana Melchiori; Graciela L. Nasini; Jorge M. Montagna; Gabriela Corsano (Comput. Oper. Res., 2023)

Solving the List Coloring Problem through a Branch-and-Price algorithm. - Mauro Lucci; Daniel E. Severín; Graciela L. Nasini (CoRR, 2023)

Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Katrin Wagler (Discret. Appl. Math., 2023)

Minimizing External Vertices in Hypergraph Orientations. - Alberto José Ferrari; Valeria A. Leoni; Graciela L. Nasini; Gabriel Valiente (ISCO, 2024)