default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraciela L. Nasini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Alberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente:
Minimizing External Vertices in Hypergraph Orientations. ISCO 2024: 125-136- 2023
- [j45]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: 106118 (2023) - [j44]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: 70-86 (2023) - [i9]Mauro Lucci, Daniel E. Severín, Graciela L. Nasini:
Solving the List Coloring Problem through a Branch-and-Price algorithm. CoRR abs/2304.10995 (2023) - 2021
- [j43]Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres:
On dominating set polyhedra of circular interval graphs. Discret. Math. 344(4): 112283 (2021) - 2020
- [j42]Graciela L. Nasini, Pablo Daniel Torres:
Grundy dominating sequences on X-join product. Discret. Appl. Math. 284: 138-149 (2020)
2010 – 2019
- 2019
- [c8]Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres:
Circuits and Circulant Minors. LAGOS 2019: 147-158 - [c7]Mauro Lucci, Graciela L. Nasini, Daniel Severín:
A Branch and Price Algorithm for List Coloring Problem. LAGOS 2019: 613-624 - 2018
- [j41]Bostjan Bresar, Tim Kos, Graciela L. Nasini, Pablo Daniel Torres:
Total dominating sequences in trees, split graphs, and under modular decomposition. Discret. Optim. 28: 16-30 (2018) - [j40]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: 85-92 (2018) - [i8]Mauro Lucci, Graciela L. Nasini, Daniel Severín:
A Branch and Price Algorithm for List Coloring Problem. CoRR abs/1812.00040 (2018) - 2017
- [j39]Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Characterizing N+-perfect line graphs. Int. Trans. Oper. Res. 24(1-2): 325-337 (2017) - [j38]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): 201-223 (2017) - 2016
- [c6]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. ISCO 2016: 59-70 - 2015
- [j37]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: 41-50 (2015) - [j36]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: 181-186 (2015) - [i7]Graciela L. Nasini, Daniel E. Severín, Pablo Daniel Torres:
On the Packing Chromatic Number on Hamming Graphs and General Graphs. CoRR abs/1510.05524 (2015) - 2014
- [j35]Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The packing coloring problem for lobsters and partner limited graphs. Discret. Appl. Math. 164: 373-382 (2014) - [j34]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the equitable coloring problem. Discret. Appl. Math. 164: 413-426 (2014) - [j33]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: 460-469 (2014) - [j32]Valeria A. Leoni, Graciela L. Nasini:
Limited Packing and Multiple Domination problems: Polynomial time reductions. Discret. Appl. Math. 164: 547-553 (2014) - [j31]Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei:
Some advances on the set covering polyhedron of circulant matrices. Discret. Appl. Math. 166: 59-70 (2014) - [j30]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): 69-85 (2014) - [c5]Mariana S. Escalante, Graciela L. Nasini:
Lovász and Schrijver N_+ -Relaxation on Web Graphs. ISCO 2014: 221-229 - [c4]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A Tabu Search Heuristic for the Equitable Coloring Problem. ISCO 2014: 347-358 - [i6]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. CoRR abs/1405.7011 (2014) - [i5]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A tabu search heuristic for the Equitable Coloring Problem. CoRR abs/1405.7020 (2014) - [i4]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 abs/1411.2069 (2014) - 2013
- [j29]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): 54-60 (2013) - [j28]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: 281-286 (2013) - [j27]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: 339-344 (2013) - [i3]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A new DSATUR-based algorithm for the Equitable Coloring Problem. CoRR abs/1306.1758 (2013) - 2012
- [c3]Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The Packing Coloring Problem for (q, q-4) Graphs. ISCO 2012: 309-319 - 2011
- [j26]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini:
On the behavior of the N+-operator under blocker duality. Discret. Appl. Math. 159(5): 396-399 (2011) - [j25]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. Electron. Notes Discret. Math. 37: 159-164 (2011) - [j24]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. Electron. Notes Discret. Math. 37: 189-194 (2011) - [j23]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: 207-212 (2011) - [j22]Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
Polynomial instances of the Packing Coloring Problem. Electron. Notes Discret. Math. 37: 363-368 (2011) - [j21]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Near-perfect graphs with polyhedral N+(G). Electron. Notes Discret. Math. 37: 393-398 (2011) - [j20]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) - [i2]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the Equitable Coloring Problem. CoRR abs/1106.3348 (2011) - [i1]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. CoRR abs/1106.3349 (2011) - 2010
- [j19]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: 551-558 (2010) - [j18]Maria Patricia Dobson, Valeria A. Leoni, Graciela L. Nasini:
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs. Electron. Notes Discret. Math. 36: 559-566 (2010) - [j17]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: 1185-1192 (2010) - [j16]Valeria A. Leoni, Graciela L. Nasini:
On the computational complexity of combinatorial flexibility problems. Int. J. Comput. Math. 87(15): 3330-3343 (2010)
2000 – 2009
- 2009
- [j15]Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei:
On the dominating set polytope of web graphs. Electron. Notes Discret. Math. 35: 121-126 (2009) - [c2]Valeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini:
Recognizing Edge-Perfect Graphs: some Polynomial Instances. CTW 2009: 153-156 - 2008
- [j14]Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Combinatorial flexibility problems and their computational complexity. Electron. Notes Discret. Math. 30: 303-308 (2008) - [j13]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Some insight into characterizations of minimally nonideal matrices. Math. Methods Oper. Res. 67(2): 245-256 (2008) - 2007
- [c1]Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Some flexibility problmes and their complexity. CTW 2007: 5-8 - 2006
- [j12]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Clutter nonidealness. Discret. Appl. Math. 154(9): 1324-1334 (2006) - [j11]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): 1845-1853 (2006) - [j10]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. Discret. Appl. Math. 154(13): 1854-1864 (2006) - [j9]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) - 2005
- [j8]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): 251-255 (2005) - [j7]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Lehman's equation on near-ideal clutters. Electron. Notes Discret. Math. 19: 219-224 (2005) - 2004
- [j6]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): 193-212 (2004) - [j5]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. Electron. Notes Discret. Math. 18: 25-30 (2004) - [j4]Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
On minimal N+- rank graphs. Electron. Notes Discret. Math. 18: 109-114 (2004) - [j3]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: 115-119 (2004) - 2002
- [j2]Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini:
The disjunctive procedure and blocker duality. Discret. Appl. Math. 121(1-3): 1-13 (2002) - [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
