| Publication | Date of Publication | Type |
|---|
Operations research in the 21st century: XXI Latin-Iberoamerican conference on operations research, CLAIO 2022
Annals of Operations Research | 2026-03-30 | Paper |
The hypergraph orientation problem with vertex constraints
Discrete Applied Mathematics | 2026-02-24 | Paper |
On the proper interval completion problem within some chordal subclasses
Discrete Mathematics | 2024-11-09 | Paper |
\(k\)-tuple and \(k\)-tuple total dominations on web graphs
Matemática Contemporânea | 2024-05-06 | Paper |
New complexity results on Roman {2}-domination
RAIRO - Operations Research | 2023-09-19 | Paper |
Tuple domination on graphs with the consecutive-zeros property
(available as arXiv preprint) | 2022-04-27 | Paper |
| Efficient algorithms for tuple domination on co-biconvex graphs and web graphs | 2020-08-12 | Paper |
Labelled packing functions in graphs
Information Processing Letters | 2019-11-28 | Paper |
New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
Theoretical Computer Science | 2019-10-18 | Paper |
Tuple domination on graphs with the consecutive-zeros property
(available as arXiv preprint) | 2018-12-21 | Paper |
| Packing functions and graphs with perfect closed neighbourhood matrices | 2018-12-21 | Paper |
| Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs | 2018-08-17 | Paper |
Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
Information Processing Letters | 2018-07-17 | Paper |
On the complexity of the {\(k\)}-packing function problem
International Transactions in Operational Research | 2017-03-16 | Paper |
On the complexity of the labeled domination problem in graphs
International Transactions in Operational Research | 2017-03-16 | Paper |
Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
| NP-completeness of the \(\{k \}\)-packing function problem in graphs | 2016-10-17 | Paper |
$$\{k\}$$-Packing Functions of Graphs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
Information Processing Letters | 2015-05-21 | Paper |
Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
Theoretical Computer Science | 2015-05-18 | Paper |
Limited packing and multiple domination problems: polynomial time reductions
Discrete Applied Mathematics | 2014-05-05 | Paper |
Polynomial reductions between the limited packing and tuple domination problems in graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
The multiple domination and limited packing problems in graphs
Information Processing Letters | 2013-04-04 | Paper |
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
Discrete Optimization | 2013-03-13 | Paper |
| A graph theoretical model for the total balancedness of combinatorial games | 2012-12-06 | Paper |
The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the computational complexity of combinatorial flexibility problems
International Journal of Computer Mathematics | 2011-01-20 | Paper |
Combinatorial flexibility problems and their computational complexity
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Characterizations of postman sets
Discrete Mathematics | 2008-04-28 | Paper |
| On the relationship between disjunctive relaxations and minors in packing and covering problems | 2006-07-14 | Paper |
| scientific article; zbMATH DE number 2230195 (Why is no real title available?) | 2005-11-18 | Paper |
Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
Discrete Applied Mathematics | 2005-09-28 | Paper |
On the influence of resequencing on the regularity of service
Performance Evaluation | 2003-06-24 | Paper |
