Raul Lopes

Orcid: 0000-0002-7487-3475

Affiliations:
  • PSL University, Paris, France
  • Universidade Federal do Ceará, ParGO Research Group, Fortaleza, Brazil (PhD 2021)


According to our database1, Raul Lopes authored at least 16 papers between 2017 and 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
2
2
2
2
2
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On computing large temporal (unilateral) connected components.
J. Comput. Syst. Sci., 2024

Constant congestion linkages in polynomially strong digraphs in polynomial time.
CoRR, 2024

2023
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows.
Discret. Math. Theor. Comput. Sci., 2023

Clique number of tournaments.
CoRR, 2023

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps.
Theor. Comput. Sci., 2022

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

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Twin-Width VIII: Delineation and Win-Wins.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021
Edge-Disjoint Branchings in Temporal Digraphs.
Electron. J. Comb., 2021

Coloring Problems on Bipartite Graphs of Small Diameter.
Electron. J. Comb., 2021

2020
Edge-Disjoint Branchings in Temporal Graphs.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
Adapting The Directed Grid Theorem into an FPT Algorithm.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
A proof for a conjecture of Gorgol.
Discret. Appl. Math., 2018

Bispindles in Strongly Connected Digraphs with Large Chromatic Number.
Electron. J. Comb., 2018

2017
Bispindle in strongly connected digraphs with large chromatic number.
Electron. Notes Discret. Math., 2017


  Loading...