Valeria A. Leoni

Martín D. Safe

Inf. Process. Lett., 2020

2019

New algorithms for weighted k-domination and total k-domination problems in proper interval graphs.

[BibT_eX]

[DOI]

Nina Chiarelli

Tatiana Romina Hartinger

Martin Milanic

Theor. Comput. Sci., 2019

Tuple Domination on Graphs with the Consecutive-zeros Property.

[BibT_eX]

[DOI]

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

2018

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs.

[BibT_eX]

[DOI]

Nina Chiarelli

Tatiana Romina Hartinger

Martin Milanic

CoRR, 2018

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs.

[BibT_eX]

[DOI]

Nina Chiarelli

Tatiana Romina Hartinger

Martin Milanic

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

On the complexity of the {k}-packing function problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

On the complexity of the labeled domination problem in graphs.

[BibT_eX]

[DOI]

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]

Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Limited Packing and Multiple Domination problems: Polynomial time reductions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

k -Packing Functions of 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

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

On the computational complexity of combinatorial flexibility problems.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The k-limited packing and k-tuple domination problems in strongly chordal, P4-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

2008

Combinatorial flexibility problems and their computational complexity.

[BibT_eX]

[DOI]

Néstor E. Aguilera

Electron. Notes Discret. Math., 2008

2007

Some flexibility problmes and their complexity.

[BibT_eX]

Néstor E. Aguilera

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2005

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality".

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Characterizations of Postman Sets.

[BibT_eX]

[DOI]

Néstor E. Aguilera