![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Thiago Braga Marcilon
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Carlos V. G. C. Lima, Thiago Marcilon, Pedro Paulo de Medeiros:
The complexity of convexity number and percolation time in the cycle convexity. CoRR abs/2404.09236 (2024) - 2023
- [j6]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) - [c5]Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon:
The Conversion Set Problem on Graphs. LAGOS 2023: 175-183 - 2022
- [j5]Carlos V. G. C. Lima
, Thiago Marcilon
, Nicolas Almeida Martins, Rudini M. Sampaio
:
PSPACE-hardness of variants of the graph coloring game. Theor. Comput. Sci. 909: 87-96 (2022) - 2020
- [c4]Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Hardness of Variants of the Graph Coloring Game. LATIN 2020: 348-359
2010 – 2019
- 2019
- [j4]Mamadou Moustapha Kanté, Thiago Braga Marcilon
, Rudini M. Sampaio
:
On the parameterized complexity of the geodesic hull number. Theor. Comput. Sci. 791: 10-27 (2019) - [i3]Thiago Marcilon, Nicolas Almeida Martins, Rudini M. Sampaio:
Hardness of some variants of the graph coloring game. CoRR abs/1911.10363 (2019) - 2018
- [j3]Thiago Braga Marcilon
, Rudini M. Sampaio
:
The maximum infection time of the P3 convexity in graphs with bounded maximum degree. Discret. Appl. Math. 251: 245-257 (2018) - [j2]Thiago Braga Marcilon
, Rudini Menezes Sampaio
:
The P3 infection time is W[1]-hard parameterized by the treewidth. Inf. Process. Lett. 132: 55-61 (2018) - [j1]Thiago Braga Marcilon
, Rudini Menezes Sampaio
:
The maximum time of 2-neighbor bootstrap percolation: Complexity results. Theor. Comput. Sci. 708: 1-17 (2018) - 2015
- [c3]Thiago Braga Marcilon, Rudini M. Sampaio:
The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results. WG 2015: 169-185 - [i2]Thiago Braga Marcilon, Rudini Menezes Sampaio:
The maximum time of 2-neighbour bootstrap percolation in grid graphs and some parameterized results. CoRR abs/1508.06847 (2015) - [i1]Thiago Braga Marcilon, Rudini Menezes Sampaio:
The maximum time of 2-neighbor bootstrap percolation: complexity results. CoRR abs/1508.06874 (2015) - 2014
- [c2]Thiago Braga Marcilon
, Samuel Nascimento
, Rudini M. Sampaio
:
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results. WG 2014: 372-383 - 2013
- [c1]Thiago Braga Marcilon, Francisco Heron de Carvalho Junior:
Derivation and Verification of Parallel Components for the Needs of an HPC Cloud. SBMF 2013: 51-66
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint