Raul Lopes

collaborators

Showing cs.DSShow all

3 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 ( $k$ -DDP), we are given a digraph $k$ pairs of terminals, and the goal is to find $k$ pairwise vertex-disjoint paths connecting each pair of…

cs.DS2024

Constant congestion linkages in polynomially strong digraphs in polynomial time

Raul Lopes, Ignasi Sau

Given integers $k, c > 0$ , we say that a digraph $D$ is $(k, c)$ -linked if for every pair of ordered sets ${s_{1}, \dots, s_{k}}$ and ${t_{1}, \dots, t_{k}}$ of vertices of $D$ , there…