Raul Lopes

According to our database, Raul Lopes authored at least 19 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Revisiting Directed Disjoint Paths on Tournaments (And Relatives).

Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Disjoint Temporal Walks Under Waiting Time Constraints.

Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs.

Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva

Networks, 2024

On computing large temporal (unilateral) connected components.

Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva

J. Comput. Syst. Sci., 2024

Constant congestion linkages in polynomially strong digraphs in polynomial time.

Raul Lopes, Ignasi Sau

CoRR, 2024

2023

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.

Cláudio Carvalho, Jonas Costa, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales

Discret. Math. Theor. Comput. Sci., 2023

Clique number of tournaments.

Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes

CoRR, 2023

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages.

Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps.

Raul Lopes, Ignasi Sau

Theor. Comput. Sci., 2022

Menger's Theorem for Temporal Paths (Not Walks).

Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva

CoRR, 2022

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.

Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva

Proceedings of the WALCOM: Algorithms and Computation, 2022

Twin-Width VIII: Delineation and Win-Wins.

Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Edge-Disjoint Branchings in Temporal Digraphs.

Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva

Electron. J. Comb., 2021

Coloring Problems on Bipartite Graphs of Small Diameter.

Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva

Electron. J. Comb., 2021

2020

Edge-Disjoint Branchings in Temporal Graphs.

Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Adapting The Directed Grid Theorem into an FPT Algorithm.

Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

A proof for a conjecture of Gorgol.

Victor A. Campos, Raul Lopes

Discret. Appl. Math., 2018

Bispindles in Strongly Connected Digraphs with Large Chromatic Number.

Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes

Electron. J. Comb., 2018

2017

Bispindle in strongly connected digraphs with large chromatic number.

Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes

Electron. Notes Discret. Math., 2017