Ana Karolinna Maia

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 16

Top Topics

Subgraph Isomorphism

Computational Complexity

Computationally Efficient

Top Venues

Discret. Appl. Math.

Publications

Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346 (2024)
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)
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)
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85 (10) (2023)
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
Target set selection with maximum activation time. Discret. Appl. Math. 338 (2023)
Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso
On the hull and interval numbers of oriented graphs. CoRR (2022)
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) (2022)
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 (2021)
Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
Target set selection with maximum activation time. LAGOS (2021)
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
Target set selection with maximum activation time. CoRR (2020)
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. Algorithmica 82 (6) (2020)
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR (2020)
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS (2019)
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. LATIN (2018)
Frédéric Havet, Ana Karolinna Maia, Bojan Mohar
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87 (4) (2018)
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 (2017)
Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21 (1) (2015)
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
Finding a subdivision of a digraph. Theor. Comput. Sci. 562 (2015)
Victor A. Campos, Cláudia Linhares Sales, Rudini Menezes Sampaio, Ana Karolinna Maia
. Discret. Appl. Math. 164 (2014)
Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio
Restricted coloring problems on Graphs with few P 4's. Ann. Oper. Res. 217 (1) (2014)
Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio
s. Electron. Notes Discret. Math. 37 (2011)
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 (2011)