default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraciela L. Nasini
- > Home > Persons > Graciela L. Nasini
Publications
- 2024
[c9]Alberto José Ferrari, Valeria A. Leoni, Graciela L. Nasini, Gabriel Valiente:
Minimizing External Vertices in Hypergraph Orientations. ISCO 2024: 125-136- 2014
- [j32]Valeria A. Leoni, Graciela L. Nasini:
Limited Packing and Multiple Domination problems: Polynomial time reductions. Discret. Appl. Math. 164: 547-553 (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) - 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) - [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) - 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) - [j16]Valeria A. Leoni, Graciela L. Nasini:
On the computational complexity of combinatorial flexibility problems. Int. J. Comput. Math. 87(15): 3330-3343 (2010) - 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) - 2007
- [c1]Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Some flexibility problmes and their complexity. CTW 2007: 5-8 - 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)
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 2024-06-05 21:35 CEST 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:
