default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaul Lopes 0001
Person information
- affiliation: PSL University, Paris, France
- affiliation (PhD 2021): Universidade Federal do Ceará, ParGO Research Group, Fortaleza, Brazil
Other persons with the same name
- Raul Lopes 0002 — Universidade Federal de Ouro Preto (UFOP), Ouro Preto, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j13]Raul Lopes, Ignasi Sau:
Constant congestion linkages in polynomially strong digraphs in polynomial time. Discret. Math. 349(3): 114808 (2026)- 2025
- [j12]Victor A. Campos
, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ACM Trans. Algorithms 21(3): 26:1-26:28 (2025) - [c9]Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva:
Disjoint Temporal Walks Under Waiting Time Constraints. CIAC (2) 2025: 87-103 - [c8]Guilherme de C. M. Gomes, Raul Lopes, Ignasi Sau:
Revisiting Directed Disjoint Paths on Tournaments (And Relatives). ICALP 2025: 90:1-90:20 - [i11]Guilherme C. M. Gomes, Raul Lopes, Ignasi Sau:
Revisiting Directed Disjoint Paths on tournaments (and relatives). CoRR abs/2504.19957 (2025) - [i10]Raul Lopes, Ignasi Sau:
Finding subdigraphs in digraphs of bounded directed treewidth. CoRR abs/2508.13830 (2025) - 2024
- [j11]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On computing large temporal (unilateral) connected components. J. Comput. Syst. Sci. 144: 103548 (2024) - [j10]Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva:
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. Networks 84(2): 132-147 (2024) - [i9]Raul Lopes, Ignasi Sau:
Constant congestion linkages in polynomially strong digraphs in polynomial time. CoRR abs/2409.03873 (2024) - 2023
- [j9]Cláudio Carvalho, Jonas Costa Ferreira da Silva, Raul Lopes, Ana Karolinna Maia, Nicolas Nisse, Cláudia Linhares Sales:
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows. Discret. Math. Theor. Comput. Sci. 25(1) (2023) - [c7]Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA 2023: 30:1-30:18 - [c6]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On Computing Large Temporal (Unilateral) Connected Components. IWOCA 2023: 282-293 - [i8]Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau:
New Menger-like dualities in digraphs and applications to half-integral linkages. CoRR abs/2306.16134 (2023) - [i7]Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes:
Clique number of tournaments. CoRR abs/2310.04265 (2023) - 2022
- [j8]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. 36(3): 1887-1917 (2022) - [j7]Raul Lopes, Ignasi Sau:
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. Theor. Comput. Sci. 898: 75-91 (2022) - [c5]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c4]Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva:
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. WALCOM 2022: 251-262 - [i6]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - [i5]Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva:
Menger's Theorem for Temporal Paths (Not Walks). CoRR abs/2206.15251 (2022) - 2021
- [j6]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. 28(2): 2 (2021) - [j5]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Digraphs. Electron. J. Comb. 28(4) (2021) - 2020
- [c3]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. IWOCA 2020: 112-125 - [c2]Raul Lopes, Ignasi Sau:
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. MFCS 2020: 68:1-68:15 - [i4]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. CoRR abs/2002.12694 (2020) - [i3]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. CoRR abs/2004.11173 (2020) - [i2]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR abs/2007.07738 (2020)
2010 – 2019
- 2019
- [c1]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS 2019: 229-240 - [i1]Raul Lopes, Ignasi Sau:
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps. CoRR abs/1909.13848 (2019) - 2018
- [j4]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25(2): 2 (2018) - [j3]Victor A. Campos, Raul Lopes:
A proof for a conjecture of Gorgol. Discret. Appl. Math. 245: 202-207 (2018) - 2017
- [j2]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62: 69-74 (2017) - 2015
- [j1]Victor A. Campos, Raul Lopes:
A Proof for a Conjecture of Gorgol. Electron. Notes Discret. Math. 50: 367-372 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-30 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
