default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvia M. Bianchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Silvia M. Bianchi, Dipayan Chakraborty
, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. CALDAM 2024: 255-269- 2023
- [j34]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) - 2022
- [j33]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) - 2021
- [j32]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
- [j31]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 - [c3]Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei, Luis Miguel Torres:
Circuits and Circulant Minors. LAGOS 2019: 147-158 - 2018
- [j30]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) - 2017
- [j29]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) - [j28]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
- [j27]Silvia M. Bianchi, Mariana S. Escalante, M. S. Montelar:
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs. Discret. Appl. Math. 210: 176-184 (2016) - [j26]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) - [c2]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
- [j25]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) - [i2]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Locating-dominating sets in some families of split graphs. CTW 2015: 32-35 - 2014
- [j24]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) - [j23]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) - [j22]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) - [c1]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
Study of Identifying Code Polyhedra for Some Families of Split Graphs. ISCO 2014: 13-25 - [i1]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
- [j21]Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Katrin Wagler:
Polyhedra associated with identifying codes. Electron. Notes Discret. Math. 44: 175-180 (2013) - [j20]Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar:
A note on the disjunctive index of joined a-perfect graphs. Electron. Notes Discret. Math. 44: 327-332 (2013) - [j19]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) - 2012
- [j18]Silvia M. Bianchi, Mariana S. Escalante, M. Susana Montelar:
Lift-and-project ranks of the set covering polytope of circulant matrices. Discret. Appl. Math. 160(18): 2555-2562 (2012) - 2011
- [j17]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) - [j16]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) - [j15]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) - 2010
- [j14]Gabriela R. Argiroffo, Silvia M. Bianchi:
The nonidealness index of rank-ideal matrices. Discret. Appl. Math. 158(12): 1325-1335 (2010) - [j13]Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
A comparison between lift-and-project indices and imperfection ratio on web graphs. Electron. Notes Discret. Math. 36: 1081-1088 (2010) - [j12]Gabriela R. Argiroffo, Silvia M. Bianchi:
Row family inequalities for the set covering polyhedron. Electron. Notes Discret. Math. 36: 1169-1176 (2010) - [j11]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)
2000 – 2009
- 2009
- [j10]Gabriela R. Argiroffo, Silvia M. Bianchi:
On the set covering polyhedron of circulant matrices. Discret. Optim. 6(2): 162-173 (2009) - [j9]Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante:
Strength of facets for the set covering and set packing polyhedra on circulant matrices. Electron. Notes Discret. Math. 35: 109-114 (2009) - [j8]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) - 2008
- [j7]Gabriela R. Argiroffo, Silvia M. Bianchi:
The nonidealness index of circulant matrices. Electron. Notes Discret. Math. 30: 195-200 (2008) - [j6]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
- [j5]Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
Clutter nonidealness. Discret. Appl. Math. 154(9): 1324-1334 (2006) - [j4]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
- [j3]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
- [j2]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) - [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:22 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:
