5 citations · 10 across the 5 of their papers we have counts for
12 papers
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…
New Menger-like dualities in digraphs and applications to half-integral linkages
Victor Campos, Jonas Costa, Raul Lopes +1
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to…
On Computing Large Temporal (Unilateral) Connected Components
Isnard Lopes Costa, Raul Lopes, Andrea Marino +1
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, . Paths are sequences of adjacent edges whose appearing times are ei…
Menger's Theorem for Temporal Paths (Not Walks)
Allen Ibiapina, Raul Lopes, Andrea Marino +1
A (directed) temporal graph is a (directed) graph whose edges are available only at specific times during its (discretized) lifetime . In this setting, we ask that walks respect…