![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Maise Dantas da Silva
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j6]Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
:
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discret. Appl. Math. 245: 94-100 (2018) - [c3]Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza
:
A Survey on the Complexity of Flood-Filling Games. Adventures Between Lower Bounds and Higher Altitudes 2018: 357-376 - 2015
- [j5]Uéverton dos Santos Souza
, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva:
The Flood-It game parameterized by the vertex cover number. Electron. Notes Discret. Math. 50: 35-40 (2015) - [j4]Michael R. Fellows, Uéverton dos Santos Souza
, Fábio Protti, Maise Dantas da Silva:
Tractability and hardness of flood-filling games on trees. Theor. Comput. Sci. 576: 102-116 (2015) - [i3]Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter:
Parameterized mixed cluster editing via modular decomposition. CoRR abs/1506.00944 (2015) - 2014
- [j3]Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva:
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers. Discret. Math. Theor. Comput. Sci. 16(3): 279-290 (2014) - 2013
- [j2]Uéverton dos Santos Souza
, Fábio Protti, Maise Dantas da Silva:
Revisiting the complexity of and/or graph solution. J. Comput. Syst. Sci. 79(7): 1156-1163 (2013) - [c2]Uéverton dos Santos Souza
, Fábio Protti, Maise Dantas da Silva:
Parameterized Complexity of Flood-Filling Games on Trees. COCOON 2013: 531-542 - [i2]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized and/or graph solution. CTW 2013: 205-208 - 2012
- [i1]Maise Dantas da Silva, Fábio Protti, Uéverton dos Santos Souza:
Revisiting the Complexity of And/Or Graph Solution. CoRR abs/1203.3249 (2012)
2000 – 2009
- 2009
- [j1]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory Comput. Syst. 44(1): 91-104 (2009) - 2006
- [c1]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Bicluster Editing. IWPEC 2006: 1-12
Coauthor Index
![](https://dblp.uni-trier.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-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint