Erika M. M. Coelho

Erika Morais Martins Coelho

Braully Rocha

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

On the absolute and relative oriented clique problems' time complexity.

[BibT_eX]

[DOI]

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A Greedy Heuristic for Majority Target Set Selection in Social Networks.

[BibT_eX]

[DOI]

Braully Rocha da Silva

Erika Morais Martins Coelho

Hebert Coelho da Coelho

Fábio Protti

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2023

2022

A polynomial time algorithm for geodetic hull number for complementary prisms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2022

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

P3-convexity on graphs with diameter two: Computing hull and interval numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.

[BibT_eX]

[DOI]

Uéverton S. Souza

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

On the geodetic hull number for complementary prisms II.

[BibT_eX]

[DOI]

Erika Morais Martins Coelho

RAIRO Oper. Res., 2021

On the Oriented Coloring of the Disjoint Union of Graphs.

[BibT_eX]

[DOI]

Luérbio Faria

Mateus de Paula Ferreira

Sylvain Gravier

Sulamita Klein

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2019

On the geodetic number of complementary prisms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Open-independent, Open-locating-dominating Sets in Complementary Prism Graphs.

[BibT_eX]

[DOI]

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

P3-Hull Number of Graphs with Diameter Two.

[BibT_eX]

[DOI]

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

Identifying Codes in the Complementary Prism of Cycles.

[BibT_eX]

[DOI]

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

A note on the convexity number for complementary prisms.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

On the P3-hull number of some products of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On the convexity number for complementary prisms.

[BibT_eX]

[DOI]

CoRR, 2018

On the Geodetic Hull Number of Complementary Prisms.

[BibT_eX]

[DOI]

CoRR, 2018

Maximal independent sets in complementary prism graphs.

[BibT_eX]

Rommel M. Barbosa

Márcia R. Cappelle

Ars Comb., 2018

2016

On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

Inapproximability results for graph convexity parameters.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Rudini M. Sampaio

Theor. Comput. Sci., 2015

2014

The Carathéodory number of the P3 convexity of chordal graphs.

[BibT_eX]

[DOI]

Mitre Costa Dourado

Dieter Rautenbach

Discret. Appl. Math., 2014

2012

The colorful Helly theorem and general hypergraphs.

[BibT_eX]

[DOI]

Rommel M. Barbosa

Mitre Costa Dourado

Eur. J. Comb., 2012

2011

On the Carathéodory Number for the Convexity of Paths of Order Three.

[BibT_eX]

[DOI]