5 citations · 10 across the 5 of their papers we have counts for
7 papers · 1 filter
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…
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…
Constant congestion linkages in polynomially strong digraphs in polynomial time
Raul Lopes, Ignasi Sau
Given integers , we say that a digraph is -linked if for every pair of ordered sets and of vertices of , there…
Twin-width VIII: delineation and win-wins
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim +3
We introduce the notion of delineation. A graph class is said delineated if for every hereditary closure of a subclass of , it holds that $\ma…
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…
Edge-Disjoint Branchings in Temporal Graphs
Victor Campos, Raul Lopes, Andrea Marino +1
A temporal digraph is a triple where is a digraph, is a function on that tells us the timestamps when a vertex is active, and is a functio…
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
Raul Lopes, Ignasi Sau
In the Directed Disjoint Paths problem, we are given a digraph and a set of requests , and the task is to find a collection of pairwise vert…