Erika M. M. Coelho

Orcid: 0000-0002-3234-5789

According to our database1, Erika M. M. Coelho authored at least 25 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Complexity results on <i>k</i>-independence in some graph products.
RAIRO Oper. Res., 2024

2023
P3-Carathéodory number on graphs with diameter two (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

On the absolute and relative oriented clique problems' time complexity.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A Greedy Heuristic for Majority Target Set Selection in Social Networks.
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.
RAIRO Theor. Informatics Appl., 2022

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs.
Discret. Math. Theor. Comput. Sci., 2022

Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs.
Discret. Appl. Math., 2022

P3-convexity on graphs with diameter two: Computing hull and interval numbers.
Discret. Appl. Math., 2022

Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021
On the geodetic hull number for complementary prisms II.
RAIRO Oper. Res., 2021

On the Oriented Coloring of the Disjoint Union of Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2019
On the geodetic number of complementary prisms.
Inf. Process. Lett., 2019

Open-independent, Open-locating-dominating Sets in Complementary Prism Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

<i>P</i><sub>3</sub>-Hull Number of Graphs with Diameter Two.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Identifying Codes in the Complementary Prism of Cycles.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A note on the convexity number for complementary prisms.
Discret. Math. Theor. Comput. Sci., 2019

On the P3-hull number of some products of graphs.
Discret. Appl. Math., 2019

2018
On the convexity number for complementary prisms.
CoRR, 2018

On the Geodetic Hull Number of Complementary Prisms.
CoRR, 2018

Maximal independent sets in complementary prism graphs.
Ars Comb., 2018

2016
On the Complexity of the P<sub>3</sub>-Hull Number of the Cartesian Product of Graphs.
Electron. Notes Discret. Math., 2016

2015
Inapproximability results for graph convexity parameters.
Theor. Comput. Sci., 2015

2014
The Carathéodory number of the P<sub>3</sub> convexity of chordal graphs.
Discret. Appl. Math., 2014

2012
The colorful Helly theorem and general hypergraphs.
Eur. J. Comb., 2012

2011
On the Carathéodory Number for the Convexity of Paths of Order Three.
Electron. Notes Discret. Math., 2011


  Loading...