Gabriela R. Argiroffo

Discret. Appl. Math., 2022

2020

Linear-time algorithms for three domination-based separation problems in block graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Complexity of <i>k</i>-tuple total and total {<i>k</i>}-dominations for some subclasses of bipartite graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Polyhedra associated with identifying codes in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

On the complexity of the labeled domination problem in graphs.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

A linear-time algorithm for the identifying code problem on block graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Progress on the description of identifying code polyhedra for some families of split graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2016

2015

On the complexity of {k}-domination and k-tuple domination in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

A polyhedral approach to locating-dominating sets in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Locating-dominating sets in some families of split graphs.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

The packing coloring problem for lobsters and partner limited graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Study of Identifying Code Polyhedra for Some Families of Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

{k}-domination for chordal graphs and related graph classes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

The 2-dominating set polytope of cycles and related graph classes.

[BibT_eX]

[DOI]

Mariana S. Escalante

María Elisa Ugarte

Electron. Notes Discret. Math., 2013

Polyhedra associated with identifying codes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

The Packing Coloring Problem for (q, q-4) Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Polynomial instances of the Packing Coloring Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Generalized row family inequalities for the set covering polyhedron.

[BibT_eX]

[DOI]

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

On the k-dominating set polytope of web graphs.

[BibT_eX]

[DOI]

María Elisa Ugarte

Mariana S. Escalante

Electron. Notes Discret. Math., 2010

Row family inequalities for the set covering polyhedron.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

The nonidealness index of rank-ideal matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

On the set covering polyhedron of circulant matrices.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

Some insight into characterizations of minimally nonideal matrices.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2008

The nonidealness index of circulant matrices.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2006

On a certain class of nonideal clutters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Clutter nonidealness.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Lehman's equation on near-ideal clutters.

[BibT_eX]

[DOI]