activity
20112025
most citedFinding a subdivision of a prescribed digraph of order 4

4 citations · 5 across the 7 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021

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…