Ana Karolinna Maia

25 papers B 2C 3Journal 20
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the hull and interval numbers of oriented graphs.
Discret. Appl. Math.
Júlio Araújo, Ana Karolinna Maia, Pedro Paulo de Medeiros, Lucia Draque Penso
2025 J jnl
Minimum cost flow decomposition on arc-coloured networks.
CoRR
Claudio Carvalho Neto, Ana Karolinna Maia, Cláudia Linhares Sales, Jonas Costa Ferreira da Silva
2024 J jnl
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
Discret. Appl. Math.
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2023 B conf
Deciding the Erdős-Pósa Property in 3-Connected Digraphs.
WG
Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
2023 J jnl
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.
Discret. Math. Theor. Comput. Sci.
Cláudio Carvalho, Jonas Costa Ferreira da Silva, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales
2023 J jnl
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica
Júlio Araújo, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
2023 C conf
On the hull and interval numbers of oriented graphs (Brief Announcement).
LAGOS
Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso
2023 J jnl
Target set selection with maximum activation time.
Discret. Appl. Math.
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2022 J jnl
Adapting the Directed Grid Theorem into an FPT Algorithm.
SIAM J. Discret. Math.
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2022 J jnl
On the hull and interval numbers of oriented graphs.
CoRR
Júlio Araújo, Ana Karolinna Maia, P. P. Medeiros, Lucia Draque Penso
2021 J jnl
FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
CoRR
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2021 C conf
Target set selection with maximum activation time.
LAGOS
Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
2020 J jnl
Adapting the Directed Grid Theorem into an FPT Algorithm.
CoRR
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2020 J jnl
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
Algorithmica
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2020 J jnl
Target set selection with maximum activation time.
CoRR
Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau
2019 C conf
Adapting The Directed Grid Theorem into an FPT Algorithm.
LAGOS
Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
2018 J jnl
Finding a subdivision of a prescribed digraph of order 4.
J. Graph Theory
Frédéric Havet, Ana Karolinna Maia, Bojan Mohar
2018 B conf
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths.
LATIN
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2017 J jnl
On the complexity of finding internally vertex-disjoint long directed paths.
CoRR
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva
2015 J jnl
Complexity of greedy edge-colouring.
J. Braz. Comput. Soc.
Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
2015 J jnl
Finding a subdivision of a digraph.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
2014 J jnl
Maximization coloring problems on graphs with few P
Discret. Appl. Math.
Victor A. Campos, Cláudia Linhares Sales, Rudini Menezes Sampaio, Ana Karolinna Maia
2014 J jnl
Restricted coloring problems on Graphs with few P 4's.
Ann. Oper. Res.
Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio
2011 J jnl
Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings
CoRR
Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio
2011 J jnl
Restricted coloring problems on graphs with few P'
Electron. Notes Discret. Math.
Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio