default search action
Ana Karolinna Maia
Person information
- affiliation: Federal University of Ceará, Fortaleza, Ceará, Brazil
- affiliation (Ph.D., 2014): INRIA, Sophia Antipolis, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Stéphane Bessy
, Florian Hörsch
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346: 80-94 (2024) - 2023
- [j10]Júlio Araújo
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85(10): 2962-3002 (2023) - [j9]Lucas Keiler
Target set selection with maximum activation time. Discret. Appl. Math. 338: 199-217 (2023) - [c5]J. Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs (Brief Announcement). LAGOS 2023: 397-399 - [c4]Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva:
Deciding the Erdős-Pósa Property in 3-Connected Digraphs. WG 2023: 59-71 - 2022
- [j8]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. 36(3): 1887-1917 (2022) - [i6]Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso:
On the hull and interval numbers of oriented graphs. CoRR abs/2210.01598 (2022) - 2021
- [c3]Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
Target set selection with maximum activation time. LAGOS 2021: 86-96 - [i5]Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR abs/2105.01582 (2021) - 2020
- [j7]Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica 82(6): 1616-1639 (2020) - [i4]Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. CoRR abs/2007.05246 (2020) - [i3]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR abs/2007.07738 (2020)
2010 – 2019
- 2019
- [c2]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS 2019: 229-240 - 2018
- [j6]Frédéric Havet, Ana Karolinna Maia
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87(4): 536-560 (2018) - [c1]Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. LATIN 2018: 66-79 - 2017
- [i2]Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva:
On the complexity of finding internally vertex-disjoint long directed paths. CoRR abs/1706.09066 (2017) - 2015
- [j5]Frédéric Havet, Ana Karolinna Maia, Min-Li Yu:
Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21(1): 18:1-18:7 (2015) - [j4]Jørgen Bang-Jensen
Finding a subdivision of a digraph. Theor. Comput. Sci. 562: 283-303 (2015) - 2014
- [b1]Ana Karolinna Maia de Oliveira:
Subdivisions of digraphs. (Subdivisions de digraphes). University of Nice Sophia Antipolis, France, 2014 - [j3]Cláudia Linhares Sales
Restricted coloring problems on Graphs with few P 4's. Ann. Oper. Res. 217(1): 385-397 (2014) - [j2]Victor A. Campos, Cláudia Linhares Sales
Maximization coloring problems on graphs with few P4. Discret. Appl. Math. 164: 539-546 (2014) - 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
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-19 21:51 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: