Bispindle in strongly connected digraphs with large chromatic number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. Notes Discret. Math., 2017)

Bispindles in Strongly Connected Digraphs with Large Chromatic Number. - Nathann Cohen; Frédéric Havet; William Lochet; Raul Lopes 001 (Electron. J. Comb., 2018)

A proof for a conjecture of Gorgol. - Victor A. Campos; Raul Lopes 001 (Discret. Appl. Math., 2018)

Adapting The Directed Grid Theorem into an FPT Algorithm. - Victor A. Campos; Raul Lopes 001; Ana Karolinna Maia; Ignasi Sau (LAGOS, 2019)

Edge-Disjoint Branchings in Temporal Graphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (IWOCA, 2020)

Coloring Problems on Bipartite Graphs of Small Diameter. - Victor A. Campos; Guilherme de C. M. Gomes; Allen Ibiapina; Raul Lopes 001; Ignasi Sau; Ana Silva 001 (Electron. J. Comb., 2021)

Edge-Disjoint Branchings in Temporal Digraphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (Electron. J. Comb., 2021)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (WALCOM, 2022)

Menger's Theorem for Temporal Paths (Not Walks). - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CoRR, 2022)

A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. - Raul Lopes 001; Ignasi Sau (Theor. Comput. Sci., 2022)

New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. - Victor A. Campos; Jonas Costa; Raul Lopes 001; Ignasi Sau (ESA, 2023)

Clique number of tournaments. - Pierre Aboulker; Guillaume Aubian; Pierre Charbit; Raul Lopes 001 (CoRR, 2023)

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows. - Cláudio Carvalho; Jonas Costa; Raul Lopes 001; Ana Karolinna Maia; Nicolas Nisse; Cláudia Linhares Sales (Discret. Math. Theor. Comput. Sci., 2023)

Constant congestion linkages in polynomially strong digraphs in polynomial time. - Raul Lopes 001; Ignasi Sau (CoRR, 2024)

On computing large temporal (unilateral) connected components. - Isnard Lopes Costa; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2024)

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (Networks, 2024)

Disjoint Temporal Walks Under Waiting Time Constraints. - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CIAC (2), 2025)

Revisiting Directed Disjoint Paths on Tournaments (And Relatives). - Guilherme de C. M. Gomes; Raul Lopes 001; Ignasi Sau (ICALP, 2025)