Hebert Coelho

Orcid: 0009-0003-9727-0006

According to our database1, Hebert Coelho authored at least 18 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
P3-Carathéodory number on graphs with diameter two (Brief Announcement).
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

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

<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

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

2013
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
Electron. Notes Discret. Math., 2013

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
On the Oriented Chromatic Number of Union of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012


  Loading...