default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriela R. Argiroffo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler
:
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. Discret. Appl. Math. 322: 465-480 (2022)- 2020
- [j23]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Linear-time algorithms for three domination-based separation problems in block graphs. Discret. Appl. Math. 281: 6-41 (2020) - [c5]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. ISCO 2020: 3-14
2010 – 2019
- 2019
- [c4]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. LAGOS 2019: 135-145 - 2018
- [j22]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Polyhedra associated with identifying codes in graphs. Discret. Appl. Math. 245: 16-27 (2018) - [j21]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs. Inf. Process. Lett. 138: 75-80 (2018) - 2017
- [j20]Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
A linear-time algorithm for the identifying code problem on block graphs. Electron. Notes Discret. Math. 62: 249-254 (2017) - [j19]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of the labeled domination problem in graphs. Int. Trans. Oper. Res. 24(1-2): 355-367 (2017) - 2016
- [j18]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Progress on the description of identifying code polyhedra for some families of split graphs. Discret. Optim. 22: 225-240 (2016) - 2015
- [j17]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
A polyhedral approach to locating-dominating sets in graphs. Electron. Notes Discret. Math. 50: 89-94 (2015) - [j16]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of {k}-domination and k-tuple domination in graphs. Inf. Process. Lett. 115(6-8): 556-561 (2015) - [i1]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Locating-dominating sets in some families of split graphs. CTW 2015: 32-35 - 2014
- [j15]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) - [c3]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Study of Identifying Code Polyhedra for Some Families of Split Graphs. ISCO 2014: 13-25 - 2013
- [j14]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
Polyhedra associated with identifying codes. Electron. Notes Discret. Math. 44: 175-180 (2013) - [j13]Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
{k}-domination for chordal graphs and related graph classes. Electron. Notes Discret. Math. 44: 219-224 (2013) - [j12]Gabriela R. Argiroffo, Mariana S. Escalante, María Elisa Ugarte:
The 2-dominating set polytope of cycles and related graph classes. Electron. Notes Discret. Math. 44: 269-274 (2013) - 2012
- [c2]Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The Packing Coloring Problem for (q, q-4) Graphs. ISCO 2012: 309-319 - 2011
- [j11]Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
Polynomial instances of the Packing Coloring Problem. Electron. Notes Discret. Math. 37: 363-368 (2011) - [c1]Gabriela R. Argiroffo, Annegret Wagler:
Generalized row family inequalities for the set covering polyhedron. CTW 2011: 60-63 - 2010
- [j10]Gabriela R. Argiroffo, Silvia M. Bianchi:
The nonidealness index of rank-ideal matrices. Discret. Appl. Math. 158(12): 1325-1335 (2010) - [j9]Gabriela R. Argiroffo, María Elisa Ugarte, Mariana S. Escalante:
On the k-dominating set polytope of web graphs. Electron. Notes Discret. Math. 36: 1161-1168 (2010) - [j8]Gabriela R. Argiroffo, Silvia M. Bianchi:
Row family inequalities for the set covering polyhedron. Electron. Notes Discret. Math. 36: 1169-1176 (2010)
2000 – 2009
- 2009
- [j7]Gabriela R. Argiroffo, Silvia M. Bianchi:
On the set covering polyhedron of circulant matrices. Discret. Optim. 6(2): 162-173 (2009) - 2008
- [j6]Gabriela R. Argiroffo, Silvia M. Bianchi:
The nonidealness index of circulant matrices. Electron. Notes Discret. Math. 30: 195-200 (2008) - [j5]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) - 2006
- [j4]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Clutter nonidealness. Discret. Appl. Math. 154(9): 1324-1334 (2006) - [j3]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. Discret. Appl. Math. 154(13): 1854-1864 (2006) - 2005
- [j2]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
- [j1]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. Electron. Notes Discret. Math. 18: 25-30 (2004)
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:11 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:
