Gabriela R. Argiroffo

According to our database1, Gabriela R. Argiroffo authored at least 28 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Linear-time algorithms for three domination-based separation problems in block graphs.
Discret. Appl. Math., 2020

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs.
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.
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.
Inf. Process. Lett., 2018

Polyhedra associated with identifying codes in graphs.
Discret. Appl. Math., 2018

2017
On the complexity of the labeled domination problem in graphs.
Int. Trans. Oper. Res., 2017

A linear-time algorithm for the identifying code problem on block graphs.
Electron. Notes Discret. Math., 2017

2016
Progress on the description of identifying code polyhedra for some families of split graphs.
Discret. Optim., 2016

2015
On the complexity of {k}-domination and k-tuple domination in graphs.
Inf. Process. Lett., 2015

A polyhedral approach to locating-dominating sets in graphs.
Electron. Notes Discret. Math., 2015

Locating-dominating sets in some families of split graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
The packing coloring problem for lobsters and partner limited graphs.
Discret. Appl. Math., 2014

Study of Identifying Code Polyhedra for Some Families of Split Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
{k}-domination for chordal graphs and related graph classes.
Electron. Notes Discret. Math., 2013

The 2-dominating set polytope of cycles and related graph classes.
Electron. Notes Discret. Math., 2013

Polyhedra associated with identifying codes.
Electron. Notes Discret. Math., 2013

2012
The Packing Coloring Problem for (q, q-4) Graphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Polynomial instances of the Packing Coloring Problem.
Electron. Notes Discret. Math., 2011

Generalized row family inequalities for the set covering polyhedron.
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.
Electron. Notes Discret. Math., 2010

Row family inequalities for the set covering polyhedron.
Electron. Notes Discret. Math., 2010

The nonidealness index of rank-ideal matrices.
Discret. Appl. Math., 2010

2009
On the set covering polyhedron of circulant matrices.
Discret. Optim., 2009

2008
Some insight into characterizations of minimally nonideal matrices.
Math. Methods Oper. Res., 2008

The nonidealness index of circulant matrices.
Electron. Notes Discret. Math., 2008

2006
Clutter nonidealness.
Discret. Appl. Math., 2006

2005
Lehman's equation on near-ideal clutters.
Electron. Notes Discret. Math., 2005

2004
On a certain class of nonideal clutters.
Electron. Notes Discret. Math., 2004


  Loading...