Linear-time algorithms for three domination-based separation problems in block graphs von Argiroffo, Gabriela R., Bianchi, Silvia M., Lucarini, Yanina, Wagler, Annegret K.

Volltext

Polyhedra associated with identifying codes in graphs von Argiroffo, Gabriela R., Bianchi, Silvia M., P.Lucarini, Yanina, Wagler, Annegret K.

Volltext

A linear-time algorithm for the identifying code problem on block graphs von Argiroffo, Gabriela R., Bianchi, Silvia M., Lucarini, Yanina, Wagler, Annegret K.

Volltext

A polyhedral approach to locating-dominating sets in graphs von Argiroffo, Gabriela R., Bianchi, Silvia M., Wagler, Annegret K.

Volltext

The nonidealness index of rank-ideal matrices von Argiroffo, Gabriela R., Bianchi, Silvia M.

Volltext

Polyhedra associated with identifying codes in graphs von Argiroffo, Gabriela R, Bianchi, Silvia, P.Lucarini, Yanina, Wagler, Annegret K

Volltext

On a certain class of nonideal clutters von Argiroffo, Gabriela R., Bianchi, Silvia M., Nasini, Graciela L.

Volltext

Some insight into characterizations of minimally nonideal matrices von Argiroffo, Gabriela R., Bianchi, Silvia M., Nasini, Graciela L.

Volltext

On the set covering polyhedron of circulant matrices von Argiroffo, Gabriela R., Bianchi, Silvia M.

Volltext

Polyhedra associated with identifying codes von Argiroffo, Gabriela R., Bianchi, Silvia M., Wagler, Annegret K.

Volltext

Row family inequalities for the set covering polyhedron von Argiroffo, Gabriela R., Bianchi, Silvia M.

Volltext

On the k-dominating set polytope of web graphs von Argiroffo, Gabriela R., Ugarte, Maria E., Escalante, Mariana S.

Volltext

The nonidealness index of circulant matrices von Argiroffo, Gabriela R., Bianchi, Silvia M.

Volltext