|
Search the dblp DataBase
Graciela L. Nasini:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Néstor E. Aguilera, Silvia M. Bianchi, Graciela L. Nasini
Lift and project relaxations for the matching and related polytopes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:193-212 [Journal]
- Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini
The disjunctive procedure and blocker duality. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:1-13 [Journal]
- V. Leoni, Graciela L. Nasini
Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality". [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:251-255 [Journal]
- Mariana S. Escalante, Graciela L. Nasini, M. C. Varaldo
On the commutativity of antiblocker diagrams under lift-and-project operators. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:13, pp:1845-1853 [Journal]
- Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
On a certain class of nonideal clutters. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:13, pp:1854-1864 [Journal]
- Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini
Clutter nonidealness. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:9, pp:1324-1334 [Journal]
- Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. [Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2002, v:27, n:3, pp:460-469 [Journal]
- Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini
Minimal N+-rank graphs: Progress on Lipták and Tunçel's conjecture. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:6, pp:639-646 [Journal]
Some flexibility problmes and their complexity. [Citation Graph (, )][DBLP]
Recognizing Edge-Perfect Graphs: some Polynomial Instances. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|