Julliano Rosa Nascimento

Orcid: 0000-0003-3002-5172

Affiliations:
  • Universidade Federal de Goiás, INF, Goiânia, Brazil


According to our database1, Julliano Rosa Nascimento authored at least 17 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Linear-time algorithms for eliminating claws in graphs.
Int. Trans. Oper. Res., January, 2024

On the monophonic convexity in complementary prisms.
Discret. Appl. Math., January, 2024

Computing a 3-role assignment is polynomial-time solvable on complementary prisms.
CoRR, 2024

2023
Computing role assignments of Cartesian product of graphs.
RAIRO Oper. Res., May, 2023

2022
Computing some role assignments of Cartesian product of graphs.
RAIRO Oper. Res., 2022

A polynomial time algorithm for geodetic hull number for complementary prisms.
RAIRO Theor. Informatics Appl., 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 complexity of coloring -graphs.
Int. Trans. Oper. Res., 2021

Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms.
Int. J. Found. Comput. Sci., 2021

Partitioning a Graph into Complementary Subgraphs.
Graphs Comb., 2021

2019
On the geodetic number of complementary prisms.
Inf. Process. Lett., 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


  Loading...