4 citations · 4 across the 2 of their papers we have counts for
4 papers
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…
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 $…