Maria Patricia Dobson

Maria Inés Lopez Pujato

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

2017

On the complexity of the {<i>k</i>}-packing function problem.

[BibT_eX]

[DOI]

Erica G. Hinrichsen

Int. Trans. Oper. Res., 2017

2016

Towards a Polynomial Equivalence Between k -Packing Functions and k-Limited Packings in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015

Generalized limited packings of some graphs with a limited number of P4-partners.

[BibT_eX]

[DOI]

Erica G. Hinrichsen

Theor. Comput. Sci., 2015

NP-completeness of the {k}-packing function problem in graphs.

[BibT_eX]

[DOI]

Erica G. Hinrichsen

Electron. Notes Discret. Math., 2015

2013

A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games.

[BibT_eX]

[DOI]

Discret. Optim., 2013

2011

The multiple domination and limited packing problems in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

The k-limited packing and k-tuple domination problems in strongly chordal, P<sub>4</sub>-tidy and split graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

2009

Recognizing Edge-Perfect Graphs: some Polynomial Instances.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2007

On transitive orientations with restricted covering graphs.

[BibT_eX]

[DOI]

Marisa Gutierrez

Michel Habib

Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2007

2004

Treelike Comparability Graphs.

[BibT_eX]

[DOI]