5 citations · 10 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Finding subdigraphs in digraphs of bounded directed treewidth
Raul Lopes, Ignasi Sau
It is well known that directed treewidth does not enjoy the nice algorithmic properties of its undirected counterpart. There exist, however, some positive results that, essentially…
cs.DS2025
Revisiting Directed Disjoint Paths on tournaments (and relatives)
Guilherme C. M. Gomes, Raul Lopes, Ignasi Sau
In the Directed Disjoint Paths problem (-DDP), we are given a digraph pairs of terminals, and the goal is to find pairwise vertex-disjoint paths connecting each pair of…