default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulliano Rosa Nascimento
Person information
- affiliation: Universidade Federal de Goiás, INF, Goiânia, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Neethu P. K., S. V. Ullas Chandran, Julliano R. Nascimento:
On the monophonic convexity in complementary prisms. Discret. Appl. Math. 343: 224-230 (2024)- [j14]Flavia Bonomo-Braberman, Julliano R. Nascimento
, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time algorithms for eliminating claws in graphs. Int. Trans. Oper. Res. 31(1): 296-315 (2024) - [j13]Márcia R. Cappelle, Erika M. M. Coelho, Otavio Mortosa, Julliano Rosa Nascimento:
Complexity results on k-independence in some graph products. RAIRO Oper. Res. 58(3): 2367-2378 (2024) - [j12]Márcia R. Cappelle, Julliano Rosa Nascimento, Vinícius Fernandes dos Santos:
Distinct sizes of maximal independent sets on graphs with restricted girth. RAIRO Oper. Res. 58(3): 2379-2391 (2024) - [i5]Diane Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, Julliano R. Nascimento:
Computing a 3-role assignment is polynomial-time solvable on complementary prisms. CoRR abs/2402.06068 (2024) - 2023
- [j11]Diane Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, Julliano Rosa Nascimento:
Computing role assignments of Cartesian product of graphs. RAIRO Oper. Res. 57(3): 1075-1086 (2023) - 2022
- [j10]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
A polynomial time algorithm for geodetic hull number for complementary prisms. RAIRO Theor. Informatics Appl. 56: 1 (2022) - [j9]Diane Castonguay, Elisângela Silva Dias, Fernanda Neiva Mesquita, Julliano Rosa Nascimento:
Computing some role assignments of Cartesian product of graphs. RAIRO Oper. Res. 56(1): 115-121 (2022) - [c3]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza:
Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs. IWOCA 2022: 257-269 - [i4]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza:
Perfect matching cuts partitioning a graph into complementary subgraphs. CoRR abs/2210.06714 (2022) - 2021
- [j8]Julliano R. Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. Graphs Comb. 37(4): 1311-1331 (2021) - [j7]Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento:
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. Int. J. Found. Comput. Sci. 32(1): 37-52 (2021) - [j6]Matheus S. D. Alves, Julliano R. Nascimento, Uéverton S. Souza:
On the complexity of coloring -graphs. Int. Trans. Oper. Res. 28(6): 3172-3189 (2021) - [j5]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento:
On the geodetic hull number for complementary prisms II. RAIRO Oper. Res. 55(Supplement): S2403-S2415 (2021) - 2020
- [c2]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-Time Algorithms for Eliminating Claws in Graphs. COCOON 2020: 14-26 - [c1]Julliano Rosa Nascimento, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Partitioning a Graph into Complementary Subgraphs. WALCOM 2020: 223-235 - [i3]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Eliminating Claws in Graphs. CoRR abs/2004.05672 (2020)
2010 – 2019
- 2019
- [j4]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
On the P3-hull number of some products of graphs. Discret. Appl. Math. 253: 2-13 (2019) - [j3]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento:
A note on the convexity number for complementary prisms. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j2]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento:
On the geodetic number of complementary prisms. Inf. Process. Lett. 144: 39-42 (2019) - 2018
- [i2]Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Jayme Luiz Szwarcfiter:
On the Geodetic Hull Number of Complementary Prisms. CoRR abs/1807.08295 (2018) - [i1]Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento:
On the convexity number for complementary prisms. CoRR abs/1809.08220 (2018) - 2016
- [j1]Julliano R. Nascimento, Erika M. M. Coelho, Hebert Coelho, Jayme Luiz Szwarcfiter:
On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. Electron. Notes Discret. Math. 55: 169-172 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
