Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings - Victor A. Campos; Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (CoRR, 2011)

Restricted coloring problems on graphs with few P'4s. - Victor A. Campos; Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (Electron. Notes Discret. Math., 2011)

Restricted coloring problems on Graphs with few P 4's. - Cláudia Linhares Sales; Ana Karolinna Maia; Nicolas Almeida Martins; Rudini Menezes Sampaio (Ann. Oper. Res., 2014)

Maximization coloring problems on graphs with few P4. - Victor A. Campos; Cláudia Linhares Sales; Rudini Menezes Sampaio; Ana Karolinna Maia (Discret. Appl. Math., 2014)

Subdivisions of digraphs. (Subdivisions de digraphes). - Ana Karolinna Maia de Oliveira (2014)

Complexity of greedy edge-colouring. - Frédéric Havet; Ana Karolinna Maia; Min-Li Yu (J. Braz. Comput. Soc., 2015)

Finding a subdivision of a digraph. - Jørgen Bang-Jensen; Frédéric Havet; Ana Karolinna Maia (Theor. Comput. Sci., 2015)

Finding a subdivision of a prescribed digraph of order 4. - Frédéric Havet; Ana Karolinna Maia; Bojan Mohar (J. Graph Theory, 2018)

Adapting The Directed Grid Theorem into an FPT Algorithm. - Victor A. Campos; Raul Lopes 001; Ana Karolinna Maia; Ignasi Sau (LAGOS, 2019)

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. - Júlio Araújo 001; Victor A. Campos; Ana Karolinna Maia; Ignasi Sau; Ana Silva 001 (Algorithmica, 2020)

On the hull and interval numbers of oriented graphs. - Júlio Araújo 001; Ana Karolinna Maia; P. P. Medeiros; Lucia Draque Penso (CoRR, 2022)

On the hull and interval numbers of oriented graphs (Brief Announcement). - J. Araújo; Ana Karolinna Maia; P. P. Medeiros; Lucia Draque Penso (LAGOS, 2023)

Deciding the Erdős-Pósa Property in 3-Connected Digraphs. - Julien Bensmail; Victor A. Campos; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (WG, 2023)

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows. - Cláudio Carvalho; Jonas Costa Ferreira da Silva; Raul Lopes 001; Ana Karolinna Maia; Nicolas Nisse; Cláudia Linhares Sales (Discret. Math. Theor. Comput. Sci., 2023)

On Finding the Best and Worst Orientations for the Metric Dimension. - Júlio Araújo 001; Julien Bensmail; Victor A. Campos; Frédéric Havet; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (Algorithmica, 2023)

Target set selection with maximum activation time. - Lucas Keiler; Carlos Vinícius G. C. Lima; Ana Karolinna Maia; Rudini M. Sampaio; Ignasi Sau (Discret. Appl. Math., 2023)

FPT algorithms for packing k-safe spanning rooted sub(di)graphs. - Stéphane Bessy; Florian Hörsch; Ana Karolinna Maia; Dieter Rautenbach; Ignasi Sau (Discret. Appl. Math., 2024)

Minimum cost flow decomposition on arc-coloured networks. - Claudio Carvalho Neto; Ana Karolinna Maia; Cláudia Linhares Sales; Jonas Costa Ferreira da Silva (CoRR, 2025)