4 citations · 5 across the 7 of their papers we have counts for
8 papers
Minimum cost flow decomposition on arc-coloured networks
Claudio Carvalho Neto, Ana Karolinna Maia, Cláudia Linhares Sales +1
A network is formed by a (multi)digraph together with a \emph{capacity function} , and it is denoted by . A flow on $\mathc…
On the hull and interval numbers of oriented graphs
J. Araujo, A. K. Maia, P. P. Medeiros +1
In this work, for a given oriented graph , we study its interval and hull numbers, respectively, in the oriented geodetic, P3 and P3* convexities. This last one, we believe to b…
FPT algorithms for packing -safe spanning rooted sub(di)graphs
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia +2
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput. Sci. 2015] and by Bang-Jensen, Havet, and Yeo [Discret. Appl. Math. 2016] about finding disjoint "balanced…
Target set selection with maximum activation time
Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia +2
A target set selection model is a graph with a threshold function upper-bounded by the vertex degree. For a given model, a set is a targ…
Adapting the Directed Grid Theorem into an FPT Algorithm
Victor Campos, Raul Lopes, Ana Karolinna Maia +1
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the field of structural graph theory, finding numerous applications in the design of a…
Finding a subdivision of a prescribed digraph of order 4
Frédéric Havet, A. Karolinna Maia, Bojan Mohar
The problem of when a given digraph contains a subdivision of a fixed digraph is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algor…
On the complexity of finding internally vertex-disjoint long directed paths
Júlio Araújo, Victor A. Campos, Ana Karolinna Maia +2
For two positive integers and , a -spindle is the union of pairwise internally vertex-disjoint directed paths with arcs between two vertices $…
Fixed parameter algorithms for restricted coloring problems
Victor Campos, Cláudia Linhares-Sales, Ana Karolinna Maia +2
In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number…