On Computational and Combinatorial Properties of the Total Co-independent Domination Number of Graphs. - Abel Cabrera Martínez; Frank Angel Hernández Mira; José M. Sigarreta Almira; Ismael González Yero (Comput. J., 2019)

On the global total k-domination number of graphs. - Sergio Bermudo; Abel Cabrera Martínez; Frank Angel Hernández Mira; José María Sigarreta (Discret. Appl. Math., 2019)

From Total Roman Domination in Lexicographic Product Graphs to Strongly Total Roman Domination in Graphs. - Ana Almerich-Chulia; Abel Cabrera Martínez; Frank Angel Hernández Mira; Pedro Martin-Concepcion (Symmetry, 2021)

A Multi-Phase Method for Euclidean Traveling Salesman Problems. - Víctor Hugo Pacheco-Valencia; Nodari Vakhania; Frank Angel Hernández Mira; José Alberto Hernández Aguilar (Axioms, 2022)

Exact and Approximation Algorithms for the Domination Problem. - Ernesto Parra Inza; Frank Angel Hernández Mira; José María Sigarreta Almira; Nodari Vakhania (CoRR, 2022)

A polynomial-time approximation to a minimum dominating set in a graph. - Frank Angel Hernández Mira; Ernesto Parra Inza; José M. Sigarreta Almira; Nodari Vakhania (Theor. Comput. Sci., 2022)

note on total co-independent domination in trees. - Abel Cabrera Martínez; Frank Angel Hernández Mira; José M. Sigarreta Almira; Ismael González Yero (Contributions Discret. Math., 2024)

Exact and heuristic algorithms for the domination problem. - Ernesto Parra Inza; Nodari Vakhania; José María Sigarreta Almira; Frank Angel Hernández Mira (Eur. J. Oper. Res., 2024)

Algorithms for the global domination problem. - Ernesto Parra Inza; Nodari Vakhania; José María Sigarreta Almira; Frank Angel Hernández Mira (Comput. Oper. Res., 2025)