default search action
Nicolas Almeida Martins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Carlos V. G. C. Lima, Thiago Marcilon
, Nicolas Almeida Martins, Rudini Menezes Sampaio
The connected greedy coloring game. Theor. Comput. Sci. 940(Part): 1-13 (2023) - 2022
- [j10]Carlos V. G. C. Lima
PSPACE-hardness of variants of the graph coloring game. Theor. Comput. Sci. 909: 87-96 (2022) - [j9]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio
Spy game: FPT-algorithm, hardness and graph products. Theor. Comput. Sci. 923: 304-317 (2022) - 2021
- [c3]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio:
Spy Game: FPT-Algorithm and Results on Graph Products. COCOON 2021: 680-691 - [i3]Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Spy game: FPT-algorithm, hardness and graph products. CoRR abs/2110.08898 (2021) - 2020
- [c2]Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Hardness of Variants of the Graph Coloring Game. LATIN 2020: 348-359
2010 – 2019
- 2019
- [i2]Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio:
Hardness of some variants of the graph coloring game. CoRR abs/1911.10363 (2019) - 2018
- [j8]Nicolas Almeida Martins, Rudini M. Sampaio
Locally identifying coloring of graphs with few P4s. Theor. Comput. Sci. 707: 69-76 (2018) - [j7]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018) - 2016
- [j6]Márcia R. Cerioli, Nicolas Almeida Martins, Daniel F. D. Posner, Rudini M. Sampaio
L(2, 1)-labelling of graphs with few P4's. Discret. Optim. 20: 1-10 (2016) - [c1]Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. FUN 2016: 10:1-10:16 - 2015
- [j5]Victor A. Campos, Carlos Vinícius G. C. Lima
The b-chromatic index of graphs. Discret. Math. 338(11): 2072-2079 (2015) - [j4]Nicolas Almeida Martins, Rudini Menezes Sampaio
Inapproximability of the lid-chromatic number. Electron. Notes Discret. Math. 50: 121-126 (2015) - 2014
- [j3]Cláudia Linhares Sales
Restricted coloring problems on Graphs with few P 4's. Ann. Oper. Res. 217(1): 385-397 (2014) - 2013
- [j2]Carlos Vinícius G. C. Lima
b-chromatic index of graphs. Electron. Notes Discret. Math. 44: 9-14 (2013) - 2011
- [j1]Victor A. Campos, Cláudia Linhares Sales
Restricted coloring problems on graphs with few P'4s. Electron. Notes Discret. Math. 37: 57-62 (2011) - [i1]Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings. CoRR abs/1107.0056 (2011)
Coauthor Index
aka: Rudini M. Sampaio
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 2024-04-24 23:19 CEST 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: