On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. - Julliano R. Nascimento; Erika M. M. Coelho; Hebert Coelho; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2016)

On the Geodetic Hull Number of Complementary Prisms. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (CoRR, 2018)

On the convexity number for complementary prisms. - Diane Castonguay; Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento (CoRR, 2018)

On the P3-hull number of some products of graphs. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2019)

A note on the convexity number for complementary prisms. - Diane Castonguay; Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento (Discret. Math. Theor. Comput. Sci., 2019)

On the geodetic number of complementary prisms. - Diane Castonguay; Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento (Inf. Process. Lett., 2019)

Partitioning a Graph into Complementary Subgraphs. - Julliano R. Nascimento; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Graphs Comb., 2021)

Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. - Priscila P. Camargo; Uéverton S. Souza; Julliano R. Nascimento (Int. J. Found. Comput. Sci., 2021)

On the complexity of coloring -graphs. - Matheus S. D. Alves; Julliano R. Nascimento; Uéverton S. Souza (Int. Trans. Oper. Res., 2021)

On the geodetic hull number for complementary prisms II. - Diane Castonguay; Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento (RAIRO Oper. Res., 2021)

A polynomial time algorithm for geodetic hull number for complementary prisms. - Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Jayme Luiz Szwarcfiter (RAIRO Theor. Informatics Appl., 2022)

Computing some role assignments of Cartesian product of graphs. - Diane Castonguay; Elisângela Silva Dias; Fernanda Neiva Mesquita; Julliano Rosa Nascimento (RAIRO Oper. Res., 2022)

Computing role assignments of Cartesian product of graphs. - Diane Castonguay; Elisângela Silva Dias; Fernanda Neiva Mesquita; Julliano Rosa Nascimento (RAIRO Oper. Res., 2023)

Computing a 3-role assignment is polynomial-time solvable on complementary prisms. - Diane Castonguay; Elisângela Silva Dias; Fernanda Neiva Mesquita; Julliano R. Nascimento (CoRR, 2024)

Complexity results on k-independence in some graph products. - Márcia R. Cappelle; Erika M. M. Coelho; Otavio Mortosa; Julliano Rosa Nascimento (RAIRO Oper. Res., 2024)

Distinct sizes of maximal independent sets on graphs with restricted girth. - Márcia R. Cappelle; Julliano Rosa Nascimento; Vinícius Fernandes dos Santos (RAIRO Oper. Res., 2024)

On the monophonic convexity in complementary prisms. - Neethu P. K.; S. V. Ullas Chandran; Julliano R. Nascimento (Discret. Appl. Math., 2024)

Linear-time algorithms for eliminating claws in graphs. - Flavia Bonomo-Braberman; Julliano R. Nascimento; Fabiano de S. Oliveira; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Int. Trans. Oper. Res., 2024)

Perfect matching cuts partitioning a graph into complementary subgraphs. - Diane Castonguay; Erika M. M. Coelho; Hebert Coelho; Julliano R. Nascimento; Uéverton S. Souza (Ars Math. Contemp., 2025)

Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products. - Bijo S. Anand; S. V. Ullas Chandran; Julliano R. Nascimento; Revathy S. Nair (Discret. Appl. Math., 2025)