Lift and project relaxations for the matching and related polytopes. - Néstor E. Aguilera; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2004)

Lehman's equation on near-ideal clutters. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Electron. Notes Discret. Math., 2005)

Clutter nonidealness. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2006)

On a certain class of nonideal clutters. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Discret. Appl. Math., 2006)

The nonidealness index of circulant matrices. - Gabriela R. Argiroffo; Silvia M. Bianchi (Electron. Notes Discret. Math., 2008)

Some insight into characterizations of minimally nonideal matrices. - Gabriela R. Argiroffo; Silvia M. Bianchi; Graciela L. Nasini (Math. Methods Oper. Res., 2008)

On the set covering polyhedron of circulant matrices. - Gabriela R. Argiroffo; Silvia M. Bianchi (Discret. Optim., 2009)

Strength of facets for the set covering and set packing polyhedra on circulant matrices. - Silvia M. Bianchi; M. S. Montelar; Mariana S. Escalante (Electron. Notes Discret. Math., 2009)

On the dominating set polytope of web graphs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Electron. Notes Discret. Math., 2009)

The nonidealness index of rank-ideal matrices. - Gabriela R. Argiroffo; Silvia M. Bianchi (Discret. Appl. Math., 2010)

Row family inequalities for the set covering polyhedron. - Gabriela R. Argiroffo; Silvia M. Bianchi (Electron. Notes Discret. Math., 2010)

A comparison between lift-and-project indices and imperfection ratio on web graphs. - Silvia M. Bianchi; M. S. Montelar; Mariana S. Escalante (Electron. Notes Discret. Math., 2010)

The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Electron. Notes Discret. Math., 2010)

On the behavior of the N+-operator under blocker duality. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini (Discret. Appl. Math., 2011)

Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Near-perfect graphs with polyhedral N+(G). - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Lift-and-project ranks of the set covering polytope of circulant matrices. - Silvia M. Bianchi; Mariana S. Escalante; M. Susana Montelar (Discret. Appl. Math., 2012)

Polyhedra associated with identifying codes. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2013)

A note on the disjunctive index of joined a-perfect graphs. - Silvia M. Bianchi; Mariana S. Escalante; M. Susana Montelar (Electron. Notes Discret. Math., 2013)

Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2013)

Study of Identifying Code Polyhedra for Some Families of Split Graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (ISCO, 2014)

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Discret. Appl. Math., 2014)

Some advances on the set covering polyhedron of circulant matrices. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Discret. Appl. Math., 2014)

The minor inequalities in the description of the set covering polyhedron of circulant matrices. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei (Math. Methods Oper. Res., 2014)

Locating-dominating sets in some families of split graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (CTW, 2015)

A polyhedral approach to locating-dominating sets in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2015)

Lovász-Schrijver PSD-Operator on Claw-Free Graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Wagler (ISCO, 2016)

Lift-and-project ranks of the stable set polytope of joined a-perfect graphs. - Silvia M. Bianchi; Mariana S. Escalante; M. S. Montelar (Discret. Appl. Math., 2016)

Progress on the description of identifying code polyhedra for some families of split graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Annegret Wagler (Discret. Optim., 2016)

A linear-time algorithm for the identifying code problem on block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2017)

Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Math. Program., 2017)

Polyhedra associated with identifying codes in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2018)

The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (LAGOS, 2019)

Circuits and Circulant Minors. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei; Luis Miguel Torres (LAGOS, 2019)

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (ISCO, 2020)

Linear-time algorithms for three domination-based separation problems in block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2020)

On dominating set polyhedra of circular interval graphs. - Silvia M. Bianchi; Graciela L. Nasini; Paola B. Tolomei; Luis Miguel Torres (Discret. Math., 2021)

Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (Discret. Appl. Math., 2022)

Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Annegret Katrin Wagler (Discret. Appl. Math., 2023)

Location-Domination Type Problems Under the Mycielski Construction. - Silvia M. Bianchi; Dipayan Chakraborty; Yanina Lucarini; Annegret Katrin Wagler (CALDAM, 2024)