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)

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)

On the k-dominating set polytope of web graphs. - Gabriela R. Argiroffo; María Elisa Ugarte; Mariana S. Escalante (Electron. Notes Discret. Math., 2010)

Generalized row family inequalities for the set covering polyhedron. - Gabriela R. Argiroffo; Annegret Wagler (CTW, 2011)

Polynomial instances of the Packing Coloring Problem. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (Electron. Notes Discret. Math., 2011)

The Packing Coloring Problem for (q, q-4) Graphs. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (ISCO, 2012)

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

The 2-dominating set polytope of cycles and related graph classes. - Gabriela R. Argiroffo; Mariana S. Escalante; María Elisa Ugarte (Electron. Notes Discret. Math., 2013)

{k}-domination for chordal graphs and related graph classes. - Gabriela R. Argiroffo; Valeria A. Leoni; Pablo Daniel Torres (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)

The packing coloring problem for lobsters and partner limited graphs. - Gabriela R. Argiroffo; Graciela L. Nasini; Pablo Daniel Torres (Discret. Appl. Math., 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)

On the complexity of {k}-domination and k-tuple domination in graphs. - Gabriela R. Argiroffo; Valeria A. Leoni; Pablo Daniel Torres (Inf. Process. Lett., 2015)

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)

On the complexity of the labeled domination problem in graphs. - Gabriela R. Argiroffo; Valeria A. Leoni; Pablo Daniel Torres (Int. Trans. Oper. Res., 2017)

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

Complexity of k-tuple total and total {k}-dominations for some subclasses of bipartite graphs. - Gabriela R. Argiroffo; Valeria A. Leoni; Pablo Daniel Torres (Inf. Process. Lett., 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)

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)

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)