Graciela L. Nasini

Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini: A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. Discrete Optimization 10(1): 54-60 (2013)

Gabriela R. Argiroffo, Graciela L. Nasini, P. Torres: The Packing Coloring Problem for (q, q-4) Graphs. ISCO 2012: 309-319

Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini: On the behavior of the N₊-operator under blocker duality. Discrete Applied Mathematics 159(5): 396-399 (2011)

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin: Polyhedral results for the Equitable Coloring Problem. Electronic Notes in Discrete Mathematics 37: 159-164 (2011)

Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel: Some advances on Lovász-Schrijver N₊(⋅) relaxations of the fractional stable set polytope. Electronic Notes in Discrete Mathematics 37: 189-194 (2011)

Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini: Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs. Electronic Notes in Discrete Mathematics 37: 207-212 (2011)

Gabriela R. Argiroffo, Graciela L. Nasini, P. Torres: Polynomial instances of the Packing Coloring Problem. Electronic Notes in Discrete Mathematics 37: 363-368 (2011)

Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel: Near-perfect graphs with polyhedral N₊(G). Electronic Notes in Discrete Mathematics 37: 393-398 (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): 1108-1113 (2011)

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin: A polyhedral approach for the Equitable Coloring Problem. CoRR abs/1106.3348 (2011)

Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin: Polyhedral results for the Equitable Coloring Problem. CoRR abs/1106.3349 (2011)

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. Electronic Notes in Discrete Mathematics 36: 551-558 (2010)

Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini: The k-limited packing and k-tuple domination problems in strongly chordal, P₄-tidy and split graphs. Electronic Notes in Discrete Mathematics 36: 559-566 (2010)

Silvia M. Bianchi, Graciela L. Nasini, P. Tolomei: The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. Electronic Notes in Discrete Mathematics 36: 1185-1192 (2010)

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

Silvia M. Bianchi, Graciela L. Nasini, P. Tolomei: On the dominating set polytope of web graphs. Electronic Notes in Discrete Mathematics 35: 121-126 (2009)

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

Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini: Combinatorial flexibility problems and their computational complexity. Electronic Notes in Discrete Mathematics 30: 303-308 (2008)

Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini: Some insight into characterizations of minimally nonideal matrices. Math. Meth. of OR 67(2): 245-256 (2008)

Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini: Some flexibility problmes and their complexity. CTW 2007: 5-8

Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini: Clutter nonidealness. Discrete Applied Mathematics 154(9): 1324-1334 (2006)

Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo: On the commutativity of antiblocker diagrams under lift-and-project operators. Discrete Applied Mathematics 154(13): 1845-1853 (2006)

Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini: On a certain class of nonideal clutters. Discrete Applied Mathematics 154(13): 1854-1864 (2006)

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

Valeria A. Leoni, Graciela L. Nasini: Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". Discrete Applied Mathematics 150(1-3): 251-255 (2005)

Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini: Lehman's equation on near-ideal clutters. Electronic Notes in Discrete Mathematics 19: 219-224 (2005)

Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini: Lift and project relaxations for the matching and related polytopes. Discrete Applied Mathematics 134(1-3): 193-212 (2004)

Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini: On a certain class of nonideal clutters. Electronic Notes in Discrete Mathematics 18: 25-30 (2004)

Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini: On minimal N₊- rank graphs. Electronic Notes in Discrete Mathematics 18: 109-114 (2004)

Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo: Note on Lift-and-Project Ranks and Antiblocker Duality. Electronic Notes in Discrete Mathematics 18: 115-119 (2004)

Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini: The disjunctive procedure and blocker duality. Discrete Applied Mathematics 121(1-3): 1-13 (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): 460-469 (2002)